/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/xcsp/Dubois-015.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:52:13,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:52:13,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:52:13,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:52:13,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:52:13,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:52:13,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:52:13,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:52:13,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:52:13,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:52:13,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:52:13,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:52:13,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:52:13,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:52:13,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:52:13,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:52:13,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:52:13,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:52:13,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:52:13,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:52:13,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:52:13,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:52:13,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:52:13,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:52:13,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:52:13,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:52:13,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:52:13,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:52:13,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:52:13,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:52:13,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:52:13,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:52:13,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:52:13,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:52:13,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:52:13,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:52:13,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:52:13,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:52:13,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:52:13,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:52:13,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:52:13,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:52:13,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:52:13,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:52:13,559 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:52:13,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:52:13,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:52:13,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:52:13,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:52:13,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:52:13,560 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:52:13,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:52:13,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:52:13,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:52:13,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:52:13,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:52:13,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:52:13,562 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:52:13,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:52:13,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:52:13,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:52:13,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:52:13,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:52:13,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:52:13,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:52:13,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:52:13,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:52:13,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:52:13,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:52:13,563 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:52:13,563 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:52:13,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:52:13,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-01-10 01:52:13,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:52:13,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:52:13,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:52:13,750 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:52:13,751 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:52:13,753 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/Dubois-015.c [2022-01-10 01:52:13,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf4c35f0/f37249368de248fbaa522caf304d1525/FLAG20cd18e1a [2022-01-10 01:52:14,214 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:52:14,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/Dubois-015.c [2022-01-10 01:52:14,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf4c35f0/f37249368de248fbaa522caf304d1525/FLAG20cd18e1a [2022-01-10 01:52:14,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf4c35f0/f37249368de248fbaa522caf304d1525 [2022-01-10 01:52:14,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:52:14,245 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:52:14,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:52:14,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:52:14,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:52:14,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1125b4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14, skipping insertion in model container [2022-01-10 01:52:14,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:52:14,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:52:14,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/Dubois-015.c[10980,10993] [2022-01-10 01:52:14,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:52:14,535 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:52:14,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/Dubois-015.c[10980,10993] [2022-01-10 01:52:14,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:52:14,596 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:52:14,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14 WrapperNode [2022-01-10 01:52:14,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:52:14,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:52:14,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:52:14,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:52:14,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,682 INFO L137 Inliner]: procedures = 13, calls = 127, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 317 [2022-01-10 01:52:14,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:52:14,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:52:14,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:52:14,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:52:14,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:52:14,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:52:14,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:52:14,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:52:14,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (1/1) ... [2022-01-10 01:52:14,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:52:14,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:52:14,788 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-01-10 01:52:14,790 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-01-10 01:52:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:52:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:52:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:52:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:52:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2022-01-10 01:52:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2022-01-10 01:52:14,939 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:52:14,940 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:52:15,271 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:52:15,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:52:15,286 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 01:52:15,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:52:15 BoogieIcfgContainer [2022-01-10 01:52:15,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:52:15,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:52:15,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:52:15,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:52:15,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:52:14" (1/3) ... [2022-01-10 01:52:15,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b28d501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:52:15, skipping insertion in model container [2022-01-10 01:52:15,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:52:14" (2/3) ... [2022-01-10 01:52:15,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b28d501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:52:15, skipping insertion in model container [2022-01-10 01:52:15,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:52:15" (3/3) ... [2022-01-10 01:52:15,293 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-015.c [2022-01-10 01:52:15,297 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:52:15,297 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:52:15,325 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:52:15,329 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-01-10 01:52:15,329 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:52:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2022-01-10 01:52:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2022-01-10 01:52:15,363 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:52:15,363 INFO L514 BasicCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:52:15,364 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:52:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:52:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash -742393268, now seen corresponding path program 1 times [2022-01-10 01:52:15,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:52:15,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011784669] [2022-01-10 01:52:15,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:52:15,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:52:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:52:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:52:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 01:52:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 01:52:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 01:52:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:52:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 01:52:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:52:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:52:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:52:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-10 01:52:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:52:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:52:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 01:52:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:52:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:52:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:52:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:52:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-10 01:52:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 01:52:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-01-10 01:52:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-10 01:52:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-10 01:52:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-01-10 01:52:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-01-10 01:52:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-10 01:52:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:52:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-01-10 01:52:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:52:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-10 01:52:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-01-10 01:52:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-01-10 01:52:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-01-10 01:52:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-01-10 01:52:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-10 01:52:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-01-10 01:52:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-01-10 01:52:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-01-10 01:52:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-01-10 01:52:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-01-10 01:52:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-01-10 01:52:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-01-10 01:52:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-01-10 01:52:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-01-10 01:52:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-01-10 01:52:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-01-10 01:52:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-01-10 01:52:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-01-10 01:52:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-01-10 01:52:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-01-10 01:52:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-01-10 01:52:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-01-10 01:52:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-01-10 01:52:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-01-10 01:52:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-01-10 01:52:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-01-10 01:52:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-01-10 01:52:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-01-10 01:52:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-01-10 01:52:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-01-10 01:52:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-01-10 01:52:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-01-10 01:52:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-01-10 01:52:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-01-10 01:52:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2022-01-10 01:52:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-01-10 01:52:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-01-10 01:52:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-01-10 01:52:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2022-01-10 01:52:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-01-10 01:52:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2022-01-10 01:52:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2022-01-10 01:52:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 398 [2022-01-10 01:52:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2022-01-10 01:52:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2022-01-10 01:52:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-01-10 01:52:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2022-01-10 01:52:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2022-01-10 01:52:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2022-01-10 01:52:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-01-10 01:52:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2022-01-10 01:52:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2022-01-10 01:52:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-01-10 01:52:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2022-01-10 01:52:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2022-01-10 01:52:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2022-01-10 01:52:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2022-01-10 01:52:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2022-01-10 01:52:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2022-01-10 01:52:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-01-10 01:52:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2022-01-10 01:52:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2022-01-10 01:52:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2022-01-10 01:52:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2022-01-10 01:52:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 517 [2022-01-10 01:52:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 522 [2022-01-10 01:52:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 527 [2022-01-10 01:52:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 532 [2022-01-10 01:52:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 537 [2022-01-10 01:52:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 542 [2022-01-10 01:52:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2022-01-10 01:52:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2022-01-10 01:52:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2022-01-10 01:52:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 562 [2022-01-10 01:52:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 567 [2022-01-10 01:52:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2022-01-10 01:52:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 577 [2022-01-10 01:52:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 582 [2022-01-10 01:52:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 587 [2022-01-10 01:52:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2022-01-10 01:52:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 597 [2022-01-10 01:52:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 602 [2022-01-10 01:52:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 607 [2022-01-10 01:52:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 612 [2022-01-10 01:52:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 617 [2022-01-10 01:52:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 622 [2022-01-10 01:52:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 627 [2022-01-10 01:52:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 632 [2022-01-10 01:52:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 637 [2022-01-10 01:52:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 642 [2022-01-10 01:52:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:52:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2022-01-10 01:52:16,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:52:16,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011784669] [2022-01-10 01:52:16,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011784669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:52:16,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:52:16,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 01:52:16,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049672018] [2022-01-10 01:52:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:52:16,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 01:52:16,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:52:16,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 01:52:16,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:52:16,210 INFO L87 Difference]: Start difference. First operand has 176 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 2 states have call successors, (120) [2022-01-10 01:52:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:52:16,274 INFO L93 Difference]: Finished difference Result 346 states and 704 transitions. [2022-01-10 01:52:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 01:52:16,276 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 2 states have call successors, (120) Word has length 648 [2022-01-10 01:52:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:52:16,286 INFO L225 Difference]: With dead ends: 346 [2022-01-10 01:52:16,286 INFO L226 Difference]: Without dead ends: 173 [2022-01-10 01:52:16,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:52:16,298 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:52:16,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:52:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-01-10 01:52:16,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-01-10 01:52:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 51 states have (on average 1.0) internal successors, (51), 51 states have internal predecessors, (51), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2022-01-10 01:52:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 291 transitions. [2022-01-10 01:52:16,367 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 291 transitions. Word has length 648 [2022-01-10 01:52:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:52:16,368 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 291 transitions. [2022-01-10 01:52:16,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 2 states have call successors, (120) [2022-01-10 01:52:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 291 transitions. [2022-01-10 01:52:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2022-01-10 01:52:16,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:52:16,381 INFO L514 BasicCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:52:16,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:52:16,382 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:52:16,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:52:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash 818839756, now seen corresponding path program 1 times [2022-01-10 01:52:16,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:52:16,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708390356] [2022-01-10 01:52:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:52:16,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:52:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:52:16,603 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 01:52:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:52:16,939 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 01:52:16,939 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 01:52:16,941 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 01:52:16,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:52:16,946 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-01-10 01:52:16,949 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 01:52:17,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:52:17 BoogieIcfgContainer [2022-01-10 01:52:17,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 01:52:17,096 INFO L158 Benchmark]: Toolchain (without parser) took 2851.38ms. Allocated memory was 210.8MB in the beginning and 352.3MB in the end (delta: 141.6MB). Free memory was 155.6MB in the beginning and 270.3MB in the end (delta: -114.7MB). Peak memory consumption was 187.3MB. Max. memory is 8.0GB. [2022-01-10 01:52:17,097 INFO L158 Benchmark]: CDTParser took 2.96ms. Allocated memory is still 210.8MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:52:17,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.47ms. Allocated memory was 210.8MB in the beginning and 352.3MB in the end (delta: 141.6MB). Free memory was 155.5MB in the beginning and 315.8MB in the end (delta: -160.3MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2022-01-10 01:52:17,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.11ms. Allocated memory is still 352.3MB. Free memory was 315.8MB in the beginning and 311.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 01:52:17,101 INFO L158 Benchmark]: Boogie Preprocessor took 27.07ms. Allocated memory is still 352.3MB. Free memory was 311.6MB in the beginning and 309.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 01:52:17,102 INFO L158 Benchmark]: RCFGBuilder took 565.40ms. Allocated memory is still 352.3MB. Free memory was 309.0MB in the beginning and 288.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-01-10 01:52:17,102 INFO L158 Benchmark]: TraceAbstraction took 1807.23ms. Allocated memory is still 352.3MB. Free memory was 288.0MB in the beginning and 270.3MB in the end (delta: 17.7MB). Peak memory consumption was 178.3MB. Max. memory is 8.0GB. [2022-01-10 01:52:17,106 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.96ms. Allocated memory is still 210.8MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 350.47ms. Allocated memory was 210.8MB in the beginning and 352.3MB in the end (delta: 141.6MB). Free memory was 155.5MB in the beginning and 315.8MB in the end (delta: -160.3MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 97.11ms. Allocated memory is still 352.3MB. Free memory was 315.8MB in the beginning and 311.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.07ms. Allocated memory is still 352.3MB. Free memory was 311.6MB in the beginning and 309.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 565.40ms. Allocated memory is still 352.3MB. Free memory was 309.0MB in the beginning and 288.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1807.23ms. Allocated memory is still 352.3MB. Free memory was 288.0MB in the beginning and 270.3MB in the end (delta: 17.7MB). Peak memory consumption was 178.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 326]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 322. Possible FailurePath: [L22] int cond0; [L23] int dummy = 0; [L24] int N; [L25] int var0; [L26] var0 = __VERIFIER_nondet_int() [L27] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L27] RET assume(var0 >= 0) VAL [dummy=0, var0=0] [L28] CALL assume(var0 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume(var0 <= 1) VAL [dummy=0, var0=0] [L29] int var1; [L30] var1 = __VERIFIER_nondet_int() [L31] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume(var1 >= 0) VAL [dummy=0, var0=0, var1=1] [L32] CALL assume(var1 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L32] RET assume(var1 <= 1) VAL [dummy=0, var0=0, var1=1] [L33] int var2; [L34] var2 = __VERIFIER_nondet_int() [L35] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L35] RET assume(var2 >= 0) VAL [dummy=0, var0=0, var1=1, var2=1] [L36] CALL assume(var2 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L36] RET assume(var2 <= 1) VAL [dummy=0, var0=0, var1=1, var2=1] [L37] int var3; [L38] var3 = __VERIFIER_nondet_int() [L39] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L39] RET assume(var3 >= 0) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0] [L40] CALL assume(var3 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume(var3 <= 1) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0] [L41] int var4; [L42] var4 = __VERIFIER_nondet_int() [L43] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L43] RET assume(var4 >= 0) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1] [L44] CALL assume(var4 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L44] RET assume(var4 <= 1) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1] [L45] int var5; [L46] var5 = __VERIFIER_nondet_int() [L47] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L47] RET assume(var5 >= 0) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1, var5=0] [L48] CALL assume(var5 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L48] RET assume(var5 <= 1) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1, var5=0] [L49] int var6; [L50] var6 = __VERIFIER_nondet_int() [L51] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L51] RET assume(var6 >= 0) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1, var5=0, var6=0] [L52] CALL assume(var6 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L52] RET assume(var6 <= 1) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1, var5=0, var6=0] [L53] int var7; [L54] var7 = __VERIFIER_nondet_int() [L55] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L55] RET assume(var7 >= 0) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0] [L56] CALL assume(var7 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L56] RET assume(var7 <= 1) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0] [L57] int var8; [L58] var8 = __VERIFIER_nondet_int() [L59] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L59] RET assume(var8 >= 0) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1] [L60] CALL assume(var8 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L60] RET assume(var8 <= 1) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1] [L61] int var9; [L62] var9 = __VERIFIER_nondet_int() [L63] CALL assume(var9 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L63] RET assume(var9 >= 0) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L64] CALL assume(var9 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var9 <= 1) VAL [dummy=0, var0=0, var1=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L65] int var10; [L66] var10 = __VERIFIER_nondet_int() [L67] CALL assume(var10 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var10 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L68] CALL assume(var10 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var10 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L69] int var11; [L70] var11 = __VERIFIER_nondet_int() [L71] CALL assume(var11 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var11 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L72] CALL assume(var11 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var11 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L73] int var12; [L74] var12 = __VERIFIER_nondet_int() [L75] CALL assume(var12 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var12 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L76] CALL assume(var12 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var12 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L77] int var13; [L78] var13 = __VERIFIER_nondet_int() [L79] CALL assume(var13 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var13 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L80] CALL assume(var13 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume(var13 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L81] int var14; [L82] var14 = __VERIFIER_nondet_int() [L83] CALL assume(var14 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var14 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L84] CALL assume(var14 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L84] RET assume(var14 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L85] int var15; [L86] var15 = __VERIFIER_nondet_int() [L87] CALL assume(var15 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume(var15 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L88] CALL assume(var15 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var15 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L89] int var16; [L90] var16 = __VERIFIER_nondet_int() [L91] CALL assume(var16 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var16 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L92] CALL assume(var16 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var16 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L93] int var17; [L94] var17 = __VERIFIER_nondet_int() [L95] CALL assume(var17 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var17 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L96] CALL assume(var17 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var17 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L97] int var18; [L98] var18 = __VERIFIER_nondet_int() [L99] CALL assume(var18 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var18 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L100] CALL assume(var18 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var18 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L101] int var19; [L102] var19 = __VERIFIER_nondet_int() [L103] CALL assume(var19 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var19 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L104] CALL assume(var19 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var19 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L105] int var20; [L106] var20 = __VERIFIER_nondet_int() [L107] CALL assume(var20 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var20 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L108] CALL assume(var20 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var20 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L109] int var21; [L110] var21 = __VERIFIER_nondet_int() [L111] CALL assume(var21 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var21 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L112] CALL assume(var21 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var21 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L113] int var22; [L114] var22 = __VERIFIER_nondet_int() [L115] CALL assume(var22 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var22 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L116] CALL assume(var22 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var22 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L117] int var23; [L118] var23 = __VERIFIER_nondet_int() [L119] CALL assume(var23 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var23 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L120] CALL assume(var23 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var23 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L121] int var24; [L122] var24 = __VERIFIER_nondet_int() [L123] CALL assume(var24 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var24 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L124] CALL assume(var24 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var24 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L125] int var25; [L126] var25 = __VERIFIER_nondet_int() [L127] CALL assume(var25 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var25 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L128] CALL assume(var25 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var25 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L129] int var26; [L130] var26 = __VERIFIER_nondet_int() [L131] CALL assume(var26 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var26 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L132] CALL assume(var26 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var26 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L133] int var27; [L134] var27 = __VERIFIER_nondet_int() [L135] CALL assume(var27 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var27 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L136] CALL assume(var27 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var27 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L137] int var28; [L138] var28 = __VERIFIER_nondet_int() [L139] CALL assume(var28 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L139] RET assume(var28 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L140] CALL assume(var28 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var28 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L141] int var29; [L142] var29 = __VERIFIER_nondet_int() [L143] CALL assume(var29 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var29 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L144] CALL assume(var29 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L144] RET assume(var29 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L145] int var30; [L146] var30 = __VERIFIER_nondet_int() [L147] CALL assume(var30 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L147] RET assume(var30 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L148] CALL assume(var30 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L148] RET assume(var30 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L149] int var31; [L150] var31 = __VERIFIER_nondet_int() [L151] CALL assume(var31 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L151] RET assume(var31 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L152] CALL assume(var31 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var31 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L153] int var32; [L154] var32 = __VERIFIER_nondet_int() [L155] CALL assume(var32 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var32 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L156] CALL assume(var32 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L156] RET assume(var32 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L157] int var33; [L158] var33 = __VERIFIER_nondet_int() [L159] CALL assume(var33 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L159] RET assume(var33 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L160] CALL assume(var33 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L160] RET assume(var33 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L161] int var34; [L162] var34 = __VERIFIER_nondet_int() [L163] CALL assume(var34 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L163] RET assume(var34 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L164] CALL assume(var34 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L164] RET assume(var34 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L165] int var35; [L166] var35 = __VERIFIER_nondet_int() [L167] CALL assume(var35 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L167] RET assume(var35 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L168] CALL assume(var35 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L168] RET assume(var35 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L169] int var36; [L170] var36 = __VERIFIER_nondet_int() [L171] CALL assume(var36 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L171] RET assume(var36 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L172] CALL assume(var36 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L172] RET assume(var36 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L173] int var37; [L174] var37 = __VERIFIER_nondet_int() [L175] CALL assume(var37 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L175] RET assume(var37 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L176] CALL assume(var37 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L176] RET assume(var37 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L177] int var38; [L178] var38 = __VERIFIER_nondet_int() [L179] CALL assume(var38 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L179] RET assume(var38 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L180] CALL assume(var38 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L180] RET assume(var38 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L181] int var39; [L182] var39 = __VERIFIER_nondet_int() [L183] CALL assume(var39 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L183] RET assume(var39 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L184] CALL assume(var39 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L184] RET assume(var39 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L185] int var40; [L186] var40 = __VERIFIER_nondet_int() [L187] CALL assume(var40 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L187] RET assume(var40 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L188] CALL assume(var40 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L188] RET assume(var40 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L189] int var41; [L190] var41 = __VERIFIER_nondet_int() [L191] CALL assume(var41 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L191] RET assume(var41 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L192] CALL assume(var41 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L192] RET assume(var41 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L193] int var42; [L194] var42 = __VERIFIER_nondet_int() [L195] CALL assume(var42 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L195] RET assume(var42 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L196] CALL assume(var42 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L196] RET assume(var42 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var5=0, var6=0, var7=0, var8=1, var9=0] [L197] int var43; [L198] var43 = __VERIFIER_nondet_int() [L199] CALL assume(var43 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L199] RET assume(var43 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L200] CALL assume(var43 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L200] RET assume(var43 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L201] int var44; [L202] var44 = __VERIFIER_nondet_int() [L203] CALL assume(var44 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L203] RET assume(var44 >= 0) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L204] CALL assume(var44 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L204] RET assume(var44 <= 1) VAL [dummy=0, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L205] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L206-L209] CALL assume((var28 == 0 & var29 == 0 & var0 == 1) | (var28 == 0 & var29 == 1 & var0 == 0) | (var28 == 1 & var29 == 0 & var0 == 0) | (var28 == 1 & var29 == 1 & var0 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=67, cond=67] [L206-L209] RET assume((var28 == 0 & var29 == 0 & var0 == 1) | (var28 == 0 & var29 == 1 & var0 == 0) | (var28 == 1 & var29 == 0 & var0 == 0) | (var28 == 1 & var29 == 1 & var0 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L210-L213] CALL assume((var1 == 0 & var31 == 0 & var2 == 1) | (var1 == 0 & var31 == 1 & var2 == 0) | (var1 == 1 & var31 == 0 & var2 == 0) | (var1 == 1 & var31 == 1 & var2 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=68, cond=68] [L210-L213] RET assume((var1 == 0 & var31 == 0 & var2 == 1) | (var1 == 0 & var31 == 1 & var2 == 0) | (var1 == 1 & var31 == 0 & var2 == 0) | (var1 == 1 & var31 == 1 & var2 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L214-L217] CALL assume((var2 == 0 & var32 == 0 & var3 == 1) | (var2 == 0 & var32 == 1 & var3 == 0) | (var2 == 1 & var32 == 0 & var3 == 0) | (var2 == 1 & var32 == 1 & var3 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=54, cond=54] [L214-L217] RET assume((var2 == 0 & var32 == 0 & var3 == 1) | (var2 == 0 & var32 == 1 & var3 == 0) | (var2 == 1 & var32 == 0 & var3 == 0) | (var2 == 1 & var32 == 1 & var3 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L218-L221] CALL assume((var3 == 0 & var33 == 0 & var4 == 1) | (var3 == 0 & var33 == 1 & var4 == 0) | (var3 == 1 & var33 == 0 & var4 == 0) | (var3 == 1 & var33 == 1 & var4 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=57, cond=57] [L218-L221] RET assume((var3 == 0 & var33 == 0 & var4 == 1) | (var3 == 0 & var33 == 1 & var4 == 0) | (var3 == 1 & var33 == 0 & var4 == 0) | (var3 == 1 & var33 == 1 & var4 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L222-L225] CALL assume((var4 == 0 & var34 == 0 & var5 == 1) | (var4 == 0 & var34 == 1 & var5 == 0) | (var4 == 1 & var34 == 0 & var5 == 0) | (var4 == 1 & var34 == 1 & var5 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=55, cond=55] [L222-L225] RET assume((var4 == 0 & var34 == 0 & var5 == 1) | (var4 == 0 & var34 == 1 & var5 == 0) | (var4 == 1 & var34 == 0 & var5 == 0) | (var4 == 1 & var34 == 1 & var5 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L226-L229] CALL assume((var5 == 0 & var35 == 0 & var6 == 1) | (var5 == 0 & var35 == 1 & var6 == 0) | (var5 == 1 & var35 == 0 & var6 == 0) | (var5 == 1 & var35 == 1 & var6 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=52, cond=52] [L226-L229] RET assume((var5 == 0 & var35 == 0 & var6 == 1) | (var5 == 0 & var35 == 1 & var6 == 0) | (var5 == 1 & var35 == 0 & var6 == 0) | (var5 == 1 & var35 == 1 & var6 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L230-L233] CALL assume((var6 == 0 & var36 == 0 & var7 == 1) | (var6 == 0 & var36 == 1 & var7 == 0) | (var6 == 1 & var36 == 0 & var7 == 0) | (var6 == 1 & var36 == 1 & var7 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=73, cond=73] [L230-L233] RET assume((var6 == 0 & var36 == 0 & var7 == 1) | (var6 == 0 & var36 == 1 & var7 == 0) | (var6 == 1 & var36 == 0 & var7 == 0) | (var6 == 1 & var36 == 1 & var7 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L234-L237] CALL assume((var7 == 0 & var37 == 0 & var8 == 1) | (var7 == 0 & var37 == 1 & var8 == 0) | (var7 == 1 & var37 == 0 & var8 == 0) | (var7 == 1 & var37 == 1 & var8 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=69, cond=69] [L234-L237] RET assume((var7 == 0 & var37 == 0 & var8 == 1) | (var7 == 0 & var37 == 1 & var8 == 0) | (var7 == 1 & var37 == 0 & var8 == 0) | (var7 == 1 & var37 == 1 & var8 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L238-L241] CALL assume((var8 == 0 & var38 == 0 & var9 == 1) | (var8 == 0 & var38 == 1 & var9 == 0) | (var8 == 1 & var38 == 0 & var9 == 0) | (var8 == 1 & var38 == 1 & var9 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=63, cond=63] [L238-L241] RET assume((var8 == 0 & var38 == 0 & var9 == 1) | (var8 == 0 & var38 == 1 & var9 == 0) | (var8 == 1 & var38 == 0 & var9 == 0) | (var8 == 1 & var38 == 1 & var9 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L242-L245] CALL assume((var9 == 0 & var39 == 0 & var10 == 1) | (var9 == 0 & var39 == 1 & var10 == 0) | (var9 == 1 & var39 == 0 & var10 == 0) | (var9 == 1 & var39 == 1 & var10 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=64, cond=64] [L242-L245] RET assume((var9 == 0 & var39 == 0 & var10 == 1) | (var9 == 0 & var39 == 1 & var10 == 0) | (var9 == 1 & var39 == 0 & var10 == 0) | (var9 == 1 & var39 == 1 & var10 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L246-L249] CALL assume((var10 == 0 & var40 == 0 & var11 == 1) | (var10 == 0 & var40 == 1 & var11 == 0) | (var10 == 1 & var40 == 0 & var11 == 0) | (var10 == 1 & var40 == 1 & var11 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=65, cond=65] [L246-L249] RET assume((var10 == 0 & var40 == 0 & var11 == 1) | (var10 == 0 & var40 == 1 & var11 == 0) | (var10 == 1 & var40 == 0 & var11 == 0) | (var10 == 1 & var40 == 1 & var11 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L250-L253] CALL assume((var11 == 0 & var41 == 0 & var12 == 1) | (var11 == 0 & var41 == 1 & var12 == 0) | (var11 == 1 & var41 == 0 & var12 == 0) | (var11 == 1 & var41 == 1 & var12 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=74, cond=74] [L250-L253] RET assume((var11 == 0 & var41 == 0 & var12 == 1) | (var11 == 0 & var41 == 1 & var12 == 0) | (var11 == 1 & var41 == 0 & var12 == 0) | (var11 == 1 & var41 == 1 & var12 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L254-L257] CALL assume((var12 == 0 & var42 == 0 & var13 == 1) | (var12 == 0 & var42 == 1 & var13 == 0) | (var12 == 1 & var42 == 0 & var13 == 0) | (var12 == 1 & var42 == 1 & var13 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=49, cond=49] [L254-L257] RET assume((var12 == 0 & var42 == 0 & var13 == 1) | (var12 == 0 & var42 == 1 & var13 == 0) | (var12 == 1 & var42 == 0 & var13 == 0) | (var12 == 1 & var42 == 1 & var13 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L258-L261] CALL assume((var0 == 0 & var30 == 0 & var1 == 1) | (var0 == 0 & var30 == 1 & var1 == 0) | (var0 == 1 & var30 == 0 & var1 == 0) | (var0 == 1 & var30 == 1 & var1 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=50, cond=50] [L258-L261] RET assume((var0 == 0 & var30 == 0 & var1 == 1) | (var0 == 0 & var30 == 1 & var1 == 0) | (var0 == 1 & var30 == 0 & var1 == 0) | (var0 == 1 & var30 == 1 & var1 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L262-L265] CALL assume((var14 == 0 & var43 == 0 & var44 == 1) | (var14 == 0 & var43 == 1 & var44 == 0) | (var14 == 1 & var43 == 0 & var44 == 0) | (var14 == 1 & var43 == 1 & var44 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=53, cond=53] [L262-L265] RET assume((var14 == 0 & var43 == 0 & var44 == 1) | (var14 == 0 & var43 == 1 & var44 == 0) | (var14 == 1 & var43 == 0 & var44 == 0) | (var14 == 1 & var43 == 1 & var44 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L266-L269] CALL assume((var13 == 0 & var43 == 0 & var44 == 1) | (var13 == 0 & var43 == 1 & var44 == 0) | (var13 == 1 & var43 == 0 & var44 == 0) | (var13 == 1 & var43 == 1 & var44 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=77, cond=77] [L266-L269] RET assume((var13 == 0 & var43 == 0 & var44 == 1) | (var13 == 0 & var43 == 1 & var44 == 0) | (var13 == 1 & var43 == 0 & var44 == 0) | (var13 == 1 & var43 == 1 & var44 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L270-L273] CALL assume((var16 == 0 & var41 == 0 & var15 == 1) | (var16 == 0 & var41 == 1 & var15 == 0) | (var16 == 1 & var41 == 0 & var15 == 0) | (var16 == 1 & var41 == 1 & var15 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=76, cond=76] [L270-L273] RET assume((var16 == 0 & var41 == 0 & var15 == 1) | (var16 == 0 & var41 == 1 & var15 == 0) | (var16 == 1 & var41 == 0 & var15 == 0) | (var16 == 1 & var41 == 1 & var15 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L274-L277] CALL assume((var17 == 0 & var40 == 0 & var16 == 1) | (var17 == 0 & var40 == 1 & var16 == 0) | (var17 == 1 & var40 == 0 & var16 == 0) | (var17 == 1 & var40 == 1 & var16 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=78, cond=78] [L274-L277] RET assume((var17 == 0 & var40 == 0 & var16 == 1) | (var17 == 0 & var40 == 1 & var16 == 0) | (var17 == 1 & var40 == 0 & var16 == 0) | (var17 == 1 & var40 == 1 & var16 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L278-L281] CALL assume((var18 == 0 & var39 == 0 & var17 == 1) | (var18 == 0 & var39 == 1 & var17 == 0) | (var18 == 1 & var39 == 0 & var17 == 0) | (var18 == 1 & var39 == 1 & var17 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=72, cond=72] [L278-L281] RET assume((var18 == 0 & var39 == 0 & var17 == 1) | (var18 == 0 & var39 == 1 & var17 == 0) | (var18 == 1 & var39 == 0 & var17 == 0) | (var18 == 1 & var39 == 1 & var17 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L282-L285] CALL assume((var19 == 0 & var38 == 0 & var18 == 1) | (var19 == 0 & var38 == 1 & var18 == 0) | (var19 == 1 & var38 == 0 & var18 == 0) | (var19 == 1 & var38 == 1 & var18 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=75, cond=75] [L282-L285] RET assume((var19 == 0 & var38 == 0 & var18 == 1) | (var19 == 0 & var38 == 1 & var18 == 0) | (var19 == 1 & var38 == 0 & var18 == 0) | (var19 == 1 & var38 == 1 & var18 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L286-L289] CALL assume((var20 == 0 & var37 == 0 & var19 == 1) | (var20 == 0 & var37 == 1 & var19 == 0) | (var20 == 1 & var37 == 0 & var19 == 0) | (var20 == 1 & var37 == 1 & var19 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=59, cond=59] [L286-L289] RET assume((var20 == 0 & var37 == 0 & var19 == 1) | (var20 == 0 & var37 == 1 & var19 == 0) | (var20 == 1 & var37 == 0 & var19 == 0) | (var20 == 1 & var37 == 1 & var19 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L290-L293] CALL assume((var21 == 0 & var36 == 0 & var20 == 1) | (var21 == 0 & var36 == 1 & var20 == 0) | (var21 == 1 & var36 == 0 & var20 == 0) | (var21 == 1 & var36 == 1 & var20 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=62, cond=62] [L290-L293] RET assume((var21 == 0 & var36 == 0 & var20 == 1) | (var21 == 0 & var36 == 1 & var20 == 0) | (var21 == 1 & var36 == 0 & var20 == 0) | (var21 == 1 & var36 == 1 & var20 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L294-L297] CALL assume((var22 == 0 & var35 == 0 & var21 == 1) | (var22 == 0 & var35 == 1 & var21 == 0) | (var22 == 1 & var35 == 0 & var21 == 0) | (var22 == 1 & var35 == 1 & var21 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=61, cond=61] [L294-L297] RET assume((var22 == 0 & var35 == 0 & var21 == 1) | (var22 == 0 & var35 == 1 & var21 == 0) | (var22 == 1 & var35 == 0 & var21 == 0) | (var22 == 1 & var35 == 1 & var21 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L298-L301] CALL assume((var23 == 0 & var34 == 0 & var22 == 1) | (var23 == 0 & var34 == 1 & var22 == 0) | (var23 == 1 & var34 == 0 & var22 == 0) | (var23 == 1 & var34 == 1 & var22 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=58, cond=58] [L298-L301] RET assume((var23 == 0 & var34 == 0 & var22 == 1) | (var23 == 0 & var34 == 1 & var22 == 0) | (var23 == 1 & var34 == 0 & var22 == 0) | (var23 == 1 & var34 == 1 & var22 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L302-L305] CALL assume((var24 == 0 & var33 == 0 & var23 == 1) | (var24 == 0 & var33 == 1 & var23 == 0) | (var24 == 1 & var33 == 0 & var23 == 0) | (var24 == 1 & var33 == 1 & var23 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=66, cond=66] [L302-L305] RET assume((var24 == 0 & var33 == 0 & var23 == 1) | (var24 == 0 & var33 == 1 & var23 == 0) | (var24 == 1 & var33 == 0 & var23 == 0) | (var24 == 1 & var33 == 1 & var23 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L306-L309] CALL assume((var25 == 0 & var32 == 0 & var24 == 1) | (var25 == 0 & var32 == 1 & var24 == 0) | (var25 == 1 & var32 == 0 & var24 == 0) | (var25 == 1 & var32 == 1 & var24 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=71, cond=71] [L306-L309] RET assume((var25 == 0 & var32 == 0 & var24 == 1) | (var25 == 0 & var32 == 1 & var24 == 0) | (var25 == 1 & var32 == 0 & var24 == 0) | (var25 == 1 & var32 == 1 & var24 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L310-L313] CALL assume((var26 == 0 & var31 == 0 & var25 == 1) | (var26 == 0 & var31 == 1 & var25 == 0) | (var26 == 1 & var31 == 0 & var25 == 0) | (var26 == 1 & var31 == 1 & var25 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=51, cond=51] [L310-L313] RET assume((var26 == 0 & var31 == 0 & var25 == 1) | (var26 == 0 & var31 == 1 & var25 == 0) | (var26 == 1 & var31 == 0 & var25 == 0) | (var26 == 1 & var31 == 1 & var25 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L314-L317] CALL assume((var27 == 0 & var30 == 0 & var26 == 1) | (var27 == 0 & var30 == 1 & var26 == 0) | (var27 == 1 & var30 == 0 & var26 == 0) | (var27 == 1 & var30 == 1 & var26 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=56, cond=56] [L314-L317] RET assume((var27 == 0 & var30 == 0 & var26 == 1) | (var27 == 0 & var30 == 1 & var26 == 0) | (var27 == 1 & var30 == 0 & var26 == 0) | (var27 == 1 & var30 == 1 & var26 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L318-L321] CALL assume((var15 == 0 & var42 == 0 & var14 == 1) | (var15 == 0 & var42 == 1 & var14 == 0) | (var15 == 1 & var42 == 0 & var14 == 0) | (var15 == 1 & var42 == 1 & var14 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=60, cond=60] [L318-L321] RET assume((var15 == 0 & var42 == 0 & var14 == 1) | (var15 == 0 & var42 == 1 & var14 == 0) | (var15 == 1 & var42 == 0 & var14 == 0) | (var15 == 1 & var42 == 1 & var14 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L322-L325] CALL assume((var28 == 0 & var29 == 0 & var27 == 0) | (var28 == 0 & var29 == 1 & var27 == 1) | (var28 == 1 & var29 == 0 & var27 == 1) | (var28 == 1 & var29 == 1 & var27 == 0) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=70, cond=70] [L322-L325] RET assume((var28 == 0 & var29 == 0 & var27 == 0) | (var28 == 0 & var29 == 1 & var27 == 1) | (var28 == 1 & var29 == 0 & var27 == 1) | (var28 == 1 & var29 == 1 & var27 == 0) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] [L326] reach_error() VAL [dummy=0, myvar0=1, var0=0, var1=1, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=1, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=0, var8=1, var9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 176 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 120, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 291 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1296 NumberOfCodeBlocks, 1296 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 647 ConstructedInterpolants, 0 QuantifiedInterpolants, 647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 28560/28560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-01-10 01:52:17,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...