/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 21:05:15,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 21:05:15,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 21:05:15,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 21:05:15,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 21:05:15,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 21:05:15,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 21:05:15,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 21:05:15,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 21:05:15,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 21:05:15,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 21:05:15,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 21:05:15,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 21:05:15,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 21:05:15,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 21:05:15,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 21:05:15,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 21:05:15,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 21:05:15,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 21:05:15,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 21:05:15,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 21:05:15,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 21:05:15,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 21:05:15,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 21:05:15,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 21:05:15,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 21:05:15,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 21:05:15,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 21:05:15,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 21:05:15,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 21:05:15,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 21:05:15,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 21:05:15,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 21:05:15,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 21:05:15,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 21:05:15,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 21:05:15,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 21:05:15,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 21:05:15,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 21:05:15,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 21:05:15,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 21:05:15,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 21:05:15,774 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 21:05:15,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 21:05:15,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 21:05:15,775 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 21:05:15,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 21:05:15,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 21:05:15,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 21:05:15,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 21:05:15,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 21:05:15,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 21:05:15,777 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 21:05:15,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 21:05:15,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 21:05:15,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 21:05:15,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 21:05:15,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 21:05:15,777 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 21:05:15,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 21:05:15,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:05:15,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 21:05:15,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 21:05:15,779 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 21:05:15,779 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-14 21:05:16,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 21:05:16,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 21:05:16,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 21:05:16,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 21:05:16,040 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 21:05:16,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-02-14 21:05:16,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a494ac82/ab733ef3cb4045868abe6f4a88ea20b8/FLAG71f5385a0 [2022-02-14 21:05:16,424 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 21:05:16,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-02-14 21:05:16,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a494ac82/ab733ef3cb4045868abe6f4a88ea20b8/FLAG71f5385a0 [2022-02-14 21:05:16,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a494ac82/ab733ef3cb4045868abe6f4a88ea20b8 [2022-02-14 21:05:16,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 21:05:16,843 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 21:05:16,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 21:05:16,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 21:05:16,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 21:05:16,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:05:16" (1/1) ... [2022-02-14 21:05:16,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@83dc997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:16, skipping insertion in model container [2022-02-14 21:05:16,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:05:16" (1/1) ... [2022-02-14 21:05:16,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 21:05:16,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 21:05:16,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-02-14 21:05:16,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:05:17,011 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 21:05:17,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-02-14 21:05:17,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:05:17,033 INFO L208 MainTranslator]: Completed translation [2022-02-14 21:05:17,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:17 WrapperNode [2022-02-14 21:05:17,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 21:05:17,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 21:05:17,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 21:05:17,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 21:05:17,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:17" (1/1) ... [2022-02-14 21:05:17,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:17" (1/1) ... [2022-02-14 21:05:17,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:17" (1/1) ... [2022-02-14 21:05:17,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:17" (1/1) ... [2022-02-14 21:05:17,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:17" (1/1) ... [2022-02-14 21:05:17,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:17" (1/1) ... [2022-02-14 21:05:17,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:17" (1/1) ... [2022-02-14 21:05:17,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 21:05:17,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 21:05:17,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 21:05:17,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 21:05:17,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:17" (1/1) ... [2022-02-14 21:05:17,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:05:17,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:17,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-14 21:05:17,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-14 21:05:17,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 21:05:17,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 21:05:17,119 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 21:05:17,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 21:05:17,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 21:05:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 21:05:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 21:05:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 21:05:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 21:05:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 21:05:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 21:05:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 21:05:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 21:05:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 21:05:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 21:05:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 21:05:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 21:05:17,169 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 21:05:17,170 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 21:05:17,305 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 21:05:17,310 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 21:05:17,310 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-14 21:05:17,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:05:17 BoogieIcfgContainer [2022-02-14 21:05:17,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 21:05:17,313 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 21:05:17,313 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 21:05:17,319 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 21:05:17,322 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:05:17" (1/1) ... [2022-02-14 21:05:17,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:05:17 BasicIcfg [2022-02-14 21:05:17,333 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 21:05:17,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 21:05:17,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 21:05:17,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 21:05:17,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 09:05:16" (1/4) ... [2022-02-14 21:05:17,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d871a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:05:17, skipping insertion in model container [2022-02-14 21:05:17,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:17" (2/4) ... [2022-02-14 21:05:17,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d871a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:05:17, skipping insertion in model container [2022-02-14 21:05:17,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:05:17" (3/4) ... [2022-02-14 21:05:17,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d871a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:05:17, skipping insertion in model container [2022-02-14 21:05:17,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:05:17" (4/4) ... [2022-02-14 21:05:17,351 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono6_1.cJordan [2022-02-14 21:05:17,363 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 21:05:17,363 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 21:05:17,428 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 21:05:17,434 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 21:05:17,434 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 21:05:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:05:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-14 21:05:17,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:17,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:17,449 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-02-14 21:05:17,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:17,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218872766] [2022-02-14 21:05:17,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:17,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:17,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:17,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:17,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218872766] [2022-02-14 21:05:17,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218872766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:05:17,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:05:17,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-14 21:05:17,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127932077] [2022-02-14 21:05:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:05:17,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-14 21:05:17,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-14 21:05:17,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:05:17,664 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:17,702 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-14 21:05:17,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-14 21:05:17,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-14 21:05:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:17,716 INFO L225 Difference]: With dead ends: 21 [2022-02-14 21:05:17,716 INFO L226 Difference]: Without dead ends: 14 [2022-02-14 21:05:17,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:05:17,722 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:17,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:05:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-14 21:05:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-14 21:05:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-02-14 21:05:17,746 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-02-14 21:05:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:17,747 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-14 21:05:17,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-14 21:05:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-14 21:05:17,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:17,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:17,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 21:05:17,749 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-02-14 21:05:17,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:17,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465602028] [2022-02-14 21:05:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:17,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:17,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:17,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465602028] [2022-02-14 21:05:17,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465602028] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:05:17,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:05:17,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-14 21:05:17,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197323248] [2022-02-14 21:05:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:05:17,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-14 21:05:17,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:17,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-14 21:05:17,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-14 21:05:17,911 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:17,949 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-14 21:05:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-14 21:05:17,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-14 21:05:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:17,951 INFO L225 Difference]: With dead ends: 17 [2022-02-14 21:05:17,951 INFO L226 Difference]: Without dead ends: 17 [2022-02-14 21:05:17,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-14 21:05:17,952 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:17,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:05:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-14 21:05:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-14 21:05:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-14 21:05:17,957 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-02-14 21:05:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:17,957 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-14 21:05:17,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-14 21:05:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-14 21:05:17,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:17,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:17,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 21:05:17,959 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1516694440, now seen corresponding path program 1 times [2022-02-14 21:05:17,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:17,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484854299] [2022-02-14 21:05:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:18,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:18,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484854299] [2022-02-14 21:05:18,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484854299] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:18,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030805147] [2022-02-14 21:05:18,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:18,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:18,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:18,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:18,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-14 21:05:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:18,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-14 21:05:18,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:18,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:05:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:18,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030805147] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:05:18,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:05:18,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-02-14 21:05:18,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102714855] [2022-02-14 21:05:18,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:05:18,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-14 21:05:18,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-14 21:05:18,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-14 21:05:18,333 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:18,545 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-14 21:05:18,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-14 21:05:18,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-14 21:05:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:18,546 INFO L225 Difference]: With dead ends: 31 [2022-02-14 21:05:18,546 INFO L226 Difference]: Without dead ends: 27 [2022-02-14 21:05:18,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:05:18,548 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:18,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 36 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 21:05:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-14 21:05:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-14 21:05:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-02-14 21:05:18,552 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-02-14 21:05:18,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:18,552 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-02-14 21:05:18,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:18,552 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-14 21:05:18,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-14 21:05:18,553 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:18,553 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:18,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-14 21:05:18,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:18,770 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:18,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:18,771 INFO L85 PathProgramCache]: Analyzing trace with hash -691789689, now seen corresponding path program 1 times [2022-02-14 21:05:18,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:18,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007829797] [2022-02-14 21:05:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:18,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:18,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:05:18,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:18,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007829797] [2022-02-14 21:05:18,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007829797] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:18,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644423639] [2022-02-14 21:05:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:18,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:18,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:18,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:18,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-14 21:05:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:18,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-14 21:05:18,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:05:19,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:05:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:05:19,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644423639] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:05:19,236 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:05:19,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-02-14 21:05:19,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909680598] [2022-02-14 21:05:19,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:05:19,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-14 21:05:19,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:19,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-14 21:05:19,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-14 21:05:19,243 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:19,448 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-14 21:05:19,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:05:19,449 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-14 21:05:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:19,451 INFO L225 Difference]: With dead ends: 34 [2022-02-14 21:05:19,451 INFO L226 Difference]: Without dead ends: 34 [2022-02-14 21:05:19,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-02-14 21:05:19,453 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:19,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 48 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 21:05:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-14 21:05:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-02-14 21:05:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-02-14 21:05:19,461 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-02-14 21:05:19,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:19,462 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-02-14 21:05:19,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-14 21:05:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-14 21:05:19,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:19,463 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:19,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-14 21:05:19,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-14 21:05:19,676 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:19,676 INFO L85 PathProgramCache]: Analyzing trace with hash -888303194, now seen corresponding path program 2 times [2022-02-14 21:05:19,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:19,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998803325] [2022-02-14 21:05:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:19,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:19,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:19,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998803325] [2022-02-14 21:05:19,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998803325] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:19,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860614182] [2022-02-14 21:05:19,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:05:19,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:19,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:19,826 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:19,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-14 21:05:19,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-14 21:05:19,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:05:19,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-14 21:05:19,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-14 21:05:19,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:05:19,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860614182] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:05:19,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:05:19,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-02-14 21:05:19,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144277653] [2022-02-14 21:05:19,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:05:19,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 21:05:19,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 21:05:19,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-02-14 21:05:19,982 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:20,016 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-14 21:05:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 21:05:20,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-14 21:05:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:20,017 INFO L225 Difference]: With dead ends: 37 [2022-02-14 21:05:20,017 INFO L226 Difference]: Without dead ends: 34 [2022-02-14 21:05:20,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-02-14 21:05:20,018 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:20,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:05:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-14 21:05:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-14 21:05:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-02-14 21:05:20,023 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2022-02-14 21:05:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:20,023 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-02-14 21:05:20,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-02-14 21:05:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-14 21:05:20,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:20,024 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:20,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-14 21:05:20,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:20,242 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:20,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:20,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1647316777, now seen corresponding path program 2 times [2022-02-14 21:05:20,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:20,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936396063] [2022-02-14 21:05:20,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:20,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:20,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:20,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:20,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936396063] [2022-02-14 21:05:20,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936396063] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:20,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579899128] [2022-02-14 21:05:20,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:05:20,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:20,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:20,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:20,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-14 21:05:20,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:05:20,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:05:20,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-14 21:05:20,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:20,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:05:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:05:20,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579899128] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:05:20,952 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:05:20,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 28 [2022-02-14 21:05:20,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938948121] [2022-02-14 21:05:20,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:05:20,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-14 21:05:20,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:20,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-14 21:05:20,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2022-02-14 21:05:20,954 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:25,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:05:27,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:05:29,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:05:31,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:05:34,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:05:36,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:05:40,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:05:42,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:05:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:43,922 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2022-02-14 21:05:43,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-14 21:05:43,923 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-14 21:05:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:43,924 INFO L225 Difference]: With dead ends: 86 [2022-02-14 21:05:43,924 INFO L226 Difference]: Without dead ends: 79 [2022-02-14 21:05:43,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=450, Invalid=1902, Unknown=0, NotChecked=0, Total=2352 [2022-02-14 21:05:43,926 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 46 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:43,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 87 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 454 Invalid, 5 Unknown, 0 Unchecked, 18.4s Time] [2022-02-14 21:05:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-14 21:05:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2022-02-14 21:05:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 68 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-02-14 21:05:43,934 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 32 [2022-02-14 21:05:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:43,934 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-02-14 21:05:43,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-02-14 21:05:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-14 21:05:43,935 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:43,935 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:43,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-14 21:05:44,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:44,157 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:44,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash -784123847, now seen corresponding path program 3 times [2022-02-14 21:05:44,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:44,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509456852] [2022-02-14 21:05:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:44,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:05:44,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:44,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509456852] [2022-02-14 21:05:44,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509456852] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:44,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432555170] [2022-02-14 21:05:44,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 21:05:44,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:44,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:44,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:44,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-14 21:05:44,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-14 21:05:44,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:05:44,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:05:44,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-14 21:05:44,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:05:44,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432555170] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:05:44,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:05:44,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-02-14 21:05:44,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949053710] [2022-02-14 21:05:44,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:05:44,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 21:05:44,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:44,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 21:05:44,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-14 21:05:44,474 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:44,507 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2022-02-14 21:05:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 21:05:44,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-02-14 21:05:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:44,509 INFO L225 Difference]: With dead ends: 97 [2022-02-14 21:05:44,509 INFO L226 Difference]: Without dead ends: 97 [2022-02-14 21:05:44,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-14 21:05:44,510 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:44,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:05:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-14 21:05:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 57. [2022-02-14 21:05:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-02-14 21:05:44,516 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 38 [2022-02-14 21:05:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:44,516 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-02-14 21:05:44,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-02-14 21:05:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-14 21:05:44,517 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:44,517 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:44,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-14 21:05:44,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:44,727 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1150947292, now seen corresponding path program 4 times [2022-02-14 21:05:44,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:44,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9898414] [2022-02-14 21:05:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 77 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-14 21:05:44,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:44,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9898414] [2022-02-14 21:05:44,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9898414] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:44,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848687977] [2022-02-14 21:05:44,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-14 21:05:44,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:44,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:44,881 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:44,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-14 21:05:44,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-14 21:05:44,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:05:44,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-14 21:05:44,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:45,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:05:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-14 21:05:45,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848687977] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:05:45,761 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:05:45,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 35 [2022-02-14 21:05:45,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964401402] [2022-02-14 21:05:45,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:05:45,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-14 21:05:45,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:45,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-14 21:05:45,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2022-02-14 21:05:45,764 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:57,819 WARN L228 SmtUtils]: Spent 9.71s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:05:59,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:06:01,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:06:09,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:06:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:06:15,212 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2022-02-14 21:06:15,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-14 21:06:15,213 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-02-14 21:06:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:06:15,214 INFO L225 Difference]: With dead ends: 118 [2022-02-14 21:06:15,214 INFO L226 Difference]: Without dead ends: 114 [2022-02-14 21:06:15,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=557, Invalid=2523, Unknown=0, NotChecked=0, Total=3080 [2022-02-14 21:06:15,216 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-02-14 21:06:15,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 84 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 660 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-02-14 21:06:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-14 21:06:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 75. [2022-02-14 21:06:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:06:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2022-02-14 21:06:15,222 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 41 [2022-02-14 21:06:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:06:15,223 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2022-02-14 21:06:15,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:06:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2022-02-14 21:06:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-14 21:06:15,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:06:15,224 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:06:15,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-14 21:06:15,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:06:15,431 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:06:15,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:06:15,432 INFO L85 PathProgramCache]: Analyzing trace with hash -416137673, now seen corresponding path program 5 times [2022-02-14 21:06:15,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:06:15,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665751783] [2022-02-14 21:06:15,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:06:15,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:06:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:06:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:06:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:06:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 173 proven. 100 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-02-14 21:06:15,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:06:15,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665751783] [2022-02-14 21:06:15,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665751783] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:06:15,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61999181] [2022-02-14 21:06:15,585 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-14 21:06:15,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:06:15,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:06:15,586 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:06:15,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-14 21:06:15,760 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-02-14 21:06:15,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:06:15,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:06:15,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:06:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 218 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-02-14 21:06:16,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:06:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 186 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-02-14 21:06:16,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61999181] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:06:16,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:06:16,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 5] total 22 [2022-02-14 21:06:16,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430546297] [2022-02-14 21:06:16,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:06:16,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-14 21:06:16,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:06:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-14 21:06:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-02-14 21:06:16,279 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:06:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:06:17,153 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2022-02-14 21:06:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-14 21:06:17,154 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-02-14 21:06:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:06:17,154 INFO L225 Difference]: With dead ends: 122 [2022-02-14 21:06:17,154 INFO L226 Difference]: Without dead ends: 78 [2022-02-14 21:06:17,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=384, Invalid=1872, Unknown=0, NotChecked=0, Total=2256 [2022-02-14 21:06:17,156 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 122 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-14 21:06:17,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 43 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-14 21:06:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-14 21:06:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2022-02-14 21:06:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:06:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-02-14 21:06:17,160 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2022-02-14 21:06:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:06:17,161 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-02-14 21:06:17,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:06:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-02-14 21:06:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-14 21:06:17,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:06:17,162 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:06:17,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-14 21:06:17,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:06:17,372 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:06:17,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:06:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash -748666459, now seen corresponding path program 6 times [2022-02-14 21:06:17,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:06:17,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510462990] [2022-02-14 21:06:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:06:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:06:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:06:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:06:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:06:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 35 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:06:17,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:06:17,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510462990] [2022-02-14 21:06:17,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510462990] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:06:17,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133224870] [2022-02-14 21:06:17,705 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-14 21:06:17,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:06:17,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:06:17,708 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:06:17,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-14 21:06:17,744 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-14 21:06:17,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:06:17,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-14 21:06:17,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:06:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-02-14 21:06:18,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:06:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-02-14 21:06:18,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133224870] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:06:18,361 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:06:18,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 29 [2022-02-14 21:06:18,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71527108] [2022-02-14 21:06:18,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:06:18,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-14 21:06:18,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:06:18,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-14 21:06:18,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-02-14 21:06:18,363 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:06:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:06:19,599 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-14 21:06:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-14 21:06:19,600 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-02-14 21:06:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:06:19,600 INFO L225 Difference]: With dead ends: 87 [2022-02-14 21:06:19,600 INFO L226 Difference]: Without dead ends: 82 [2022-02-14 21:06:19,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=439, Invalid=2753, Unknown=0, NotChecked=0, Total=3192 [2022-02-14 21:06:19,602 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 164 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-14 21:06:19,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 47 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-14 21:06:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-14 21:06:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-02-14 21:06:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:06:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-02-14 21:06:19,606 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 65 [2022-02-14 21:06:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:06:19,607 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-02-14 21:06:19,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:06:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-14 21:06:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-14 21:06:19,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:06:19,611 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 18, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:06:19,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-14 21:06:19,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-14 21:06:19,815 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:06:19,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:06:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1474088538, now seen corresponding path program 7 times [2022-02-14 21:06:19,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:06:19,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233170715] [2022-02-14 21:06:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:06:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:06:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:06:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:06:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:06:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-14 21:06:20,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:06:20,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233170715] [2022-02-14 21:06:20,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233170715] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:06:20,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317250884] [2022-02-14 21:06:20,188 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-14 21:06:20,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:06:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:06:20,189 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:06:20,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-14 21:06:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:06:20,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2022-02-14 21:06:20,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:06:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-14 21:06:20,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:06:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-14 21:06:21,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317250884] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:06:21,375 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:06:21,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2022-02-14 21:06:21,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134046020] [2022-02-14 21:06:21,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:06:21,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-02-14 21:06:21,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:06:21,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-14 21:06:21,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=1368, Unknown=0, NotChecked=0, Total=1892 [2022-02-14 21:06:21,378 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:07:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:07:18,173 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-02-14 21:07:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-02-14 21:07:18,173 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-02-14 21:07:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:07:18,174 INFO L225 Difference]: With dead ends: 144 [2022-02-14 21:07:18,174 INFO L226 Difference]: Without dead ends: 144 [2022-02-14 21:07:18,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 57.0s TimeCoverageRelationStatistics Valid=1882, Invalid=5089, Unknown=1, NotChecked=0, Total=6972 [2022-02-14 21:07:18,176 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 187 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-14 21:07:18,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 119 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-14 21:07:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-02-14 21:07:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-02-14 21:07:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:07:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2022-02-14 21:07:18,183 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 77 [2022-02-14 21:07:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:07:18,183 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2022-02-14 21:07:18,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:07:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-02-14 21:07:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-14 21:07:18,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:07:18,185 INFO L514 BasicCegarLoop]: trace histogram [44, 44, 40, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:07:18,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-14 21:07:18,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:07:18,399 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:07:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:07:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash 439564262, now seen corresponding path program 8 times [2022-02-14 21:07:18,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:07:18,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541762238] [2022-02-14 21:07:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:07:18,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:07:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:07:19,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:07:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:07:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 447 proven. 2420 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-14 21:07:19,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:07:19,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541762238] [2022-02-14 21:07:19,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541762238] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:07:19,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103390837] [2022-02-14 21:07:19,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:07:19,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:07:19,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:07:19,384 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:07:19,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-14 21:07:19,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:07:19,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:07:19,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 103 conjunts are in the unsatisfiable core [2022-02-14 21:07:19,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:07:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:07:21,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:07:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2856 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-14 21:07:26,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103390837] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:07:26,086 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:07:26,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 53, 45] total 136 [2022-02-14 21:07:26,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357305939] [2022-02-14 21:07:26,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:07:26,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-02-14 21:07:26,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:07:26,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-02-14 21:07:26,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=15960, Unknown=0, NotChecked=0, Total=18360 [2022-02-14 21:07:26,091 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:07:31,793 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:07:33,804 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:07:35,815 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:07:37,924 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:07:40,126 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:07:42,166 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:07:44,179 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:07:46,187 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:07:48,198 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:07:50,207 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:13:15,795 WARN L228 SmtUtils]: Spent 2.43m on a formula simplification that was a NOOP. DAG size: 185 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:13:19,889 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:13:21,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:13:23,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:13:25,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:13:28,739 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-02-14 21:18:48,141 WARN L228 SmtUtils]: Spent 2.37m on a formula simplification that was a NOOP. DAG size: 183 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:18:50,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:18:52,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:18:54,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:18:56,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:18:58,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:19:00,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:19:02,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:19:04,229 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:19:06,249 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:19:08,262 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:19:10,274 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:19:12,286 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:19:14,302 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:19:16,311 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:19:18,321 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:19:20,331 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-02-14 21:19:22,342 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false