/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:55:33,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:55:33,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:55:33,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:55:33,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:55:33,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:55:33,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:55:33,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:55:33,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:55:33,860 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:55:33,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:55:33,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:55:33,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:55:33,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:55:33,863 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:55:33,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:55:33,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:55:33,863 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:55:33,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:55:33,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:55:33,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:55:33,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:55:33,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:55:33,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:55:33,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:55:33,866 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:55:33,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:55:33,866 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:55:33,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:55:33,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:55:33,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:55:33,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:55:33,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:55:33,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:55:33,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:55:33,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:55:33,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:55:33,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:55:33,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:55:33,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:55:33,870 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:55:33,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:55:33,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:55:33,870 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:55:34,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:55:34,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:55:34,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:55:34,079 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:55:34,084 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:55:34,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2023-12-15 20:55:35,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:55:35,382 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:55:35,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i [2023-12-15 20:55:35,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0fe0c444/645a082822ff4a74b5fc33c05e9b3570/FLAGb0f298533 [2023-12-15 20:55:35,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0fe0c444/645a082822ff4a74b5fc33c05e9b3570 [2023-12-15 20:55:35,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:55:35,408 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:55:35,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:55:35,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:55:35,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:55:35,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17df47ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35, skipping insertion in model container [2023-12-15 20:55:35,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,440 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:55:35,552 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i[915,928] [2023-12-15 20:55:35,579 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:55:35,591 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:55:35,600 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-33.i[915,928] [2023-12-15 20:55:35,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:55:35,628 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:55:35,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35 WrapperNode [2023-12-15 20:55:35,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:55:35,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:55:35,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:55:35,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:55:35,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,673 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2023-12-15 20:55:35,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:55:35,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:55:35,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:55:35,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:55:35,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,701 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:55:35,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:55:35,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:55:35,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:55:35,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:55:35,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (1/1) ... [2023-12-15 20:55:35,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:55:35,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:35,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:55:35,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:55:35,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:55:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:55:35,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:55:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:55:35,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:55:35,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:55:35,891 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:55:35,900 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:55:36,089 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:55:36,134 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:55:36,134 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:55:36,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:55:36 BoogieIcfgContainer [2023-12-15 20:55:36,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:55:36,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:55:36,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:55:36,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:55:36,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:55:35" (1/3) ... [2023-12-15 20:55:36,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fd5fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:55:36, skipping insertion in model container [2023-12-15 20:55:36,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:35" (2/3) ... [2023-12-15 20:55:36,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fd5fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:55:36, skipping insertion in model container [2023-12-15 20:55:36,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:55:36" (3/3) ... [2023-12-15 20:55:36,145 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-33.i [2023-12-15 20:55:36,159 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:55:36,159 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:55:36,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:55:36,217 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@110acd36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:55:36,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:55:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 20:55:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-15 20:55:36,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:36,228 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:36,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:36,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1642551747, now seen corresponding path program 1 times [2023-12-15 20:55:36,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:36,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658315100] [2023-12-15 20:55:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:36,384 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:55:36,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110296567] [2023-12-15 20:55:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:36,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:36,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:36,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:55:36,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 20:55:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:36,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 20:55:36,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:55:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 20:55:36,695 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:55:36,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:36,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658315100] [2023-12-15 20:55:36,696 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:55:36,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110296567] [2023-12-15 20:55:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110296567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:36,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:36,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:55:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262510611] [2023-12-15 20:55:36,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:36,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:55:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:36,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:55:36,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:55:36,735 INFO L87 Difference]: Start difference. First operand has 43 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 20:55:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:36,876 INFO L93 Difference]: Finished difference Result 133 states and 223 transitions. [2023-12-15 20:55:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:55:36,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2023-12-15 20:55:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:36,885 INFO L225 Difference]: With dead ends: 133 [2023-12-15 20:55:36,885 INFO L226 Difference]: Without dead ends: 91 [2023-12-15 20:55:36,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:55:36,890 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 71 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:36,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 145 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:55:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-15 20:55:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2023-12-15 20:55:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:55:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2023-12-15 20:55:36,938 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 61 [2023-12-15 20:55:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:36,939 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2023-12-15 20:55:36,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 20:55:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2023-12-15 20:55:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-15 20:55:36,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:36,942 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:36,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 20:55:37,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-15 20:55:37,149 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:37,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1205049261, now seen corresponding path program 1 times [2023-12-15 20:55:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:37,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622491907] [2023-12-15 20:55:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:37,177 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:55:37,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546776245] [2023-12-15 20:55:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:37,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:37,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:37,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:55:37,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 20:55:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 20:55:37,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:55:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 20:55:37,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:55:37,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622491907] [2023-12-15 20:55:37,374 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:55:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546776245] [2023-12-15 20:55:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546776245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:37,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:37,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:55:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143798612] [2023-12-15 20:55:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:37,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:55:37,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:37,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:55:37,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:55:37,379 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 20:55:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:37,509 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2023-12-15 20:55:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:55:37,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 65 [2023-12-15 20:55:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:37,511 INFO L225 Difference]: With dead ends: 172 [2023-12-15 20:55:37,511 INFO L226 Difference]: Without dead ends: 91 [2023-12-15 20:55:37,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:55:37,516 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 79 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:37,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 214 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:55:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-15 20:55:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2023-12-15 20:55:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 63 states have internal predecessors, (78), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:55:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2023-12-15 20:55:37,531 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 65 [2023-12-15 20:55:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:37,535 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2023-12-15 20:55:37,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 20:55:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2023-12-15 20:55:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-15 20:55:37,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:37,539 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:37,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 20:55:37,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-15 20:55:37,744 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:37,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2078800785, now seen corresponding path program 1 times [2023-12-15 20:55:37,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:37,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879203000] [2023-12-15 20:55:37,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:37,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:37,792 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:55:37,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499966794] [2023-12-15 20:55:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:37,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:37,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:37,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:55:37,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 20:55:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 20:55:37,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:55:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-15 20:55:37,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:55:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-15 20:55:38,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:38,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879203000] [2023-12-15 20:55:38,068 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:55:38,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499966794] [2023-12-15 20:55:38,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499966794] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:55:38,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 20:55:38,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-15 20:55:38,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034280403] [2023-12-15 20:55:38,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 20:55:38,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:55:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:38,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:55:38,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:55:38,074 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 20:55:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:38,204 INFO L93 Difference]: Finished difference Result 175 states and 229 transitions. [2023-12-15 20:55:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:55:38,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2023-12-15 20:55:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:38,207 INFO L225 Difference]: With dead ends: 175 [2023-12-15 20:55:38,207 INFO L226 Difference]: Without dead ends: 94 [2023-12-15 20:55:38,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2023-12-15 20:55:38,210 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:38,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 100 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:55:38,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-15 20:55:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2023-12-15 20:55:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 69 states have internal predecessors, (82), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:55:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2023-12-15 20:55:38,227 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 65 [2023-12-15 20:55:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:38,228 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2023-12-15 20:55:38,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 20:55:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2023-12-15 20:55:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-15 20:55:38,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:38,229 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:38,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 20:55:38,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:38,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:38,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -861247500, now seen corresponding path program 1 times [2023-12-15 20:55:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:38,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159571502] [2023-12-15 20:55:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:38,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:38,475 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:55:38,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583128111] [2023-12-15 20:55:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:38,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:38,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:38,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:55:38,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 20:55:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-15 20:55:38,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:55:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 20:55:46,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:55:46,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159571502] [2023-12-15 20:55:46,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:55:46,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583128111] [2023-12-15 20:55:46,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583128111] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:46,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:46,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 20:55:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619580692] [2023-12-15 20:55:46,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:46,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 20:55:46,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:46,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 20:55:46,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:55:46,313 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 20:55:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:46,855 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2023-12-15 20:55:46,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-15 20:55:46,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 66 [2023-12-15 20:55:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:46,857 INFO L225 Difference]: With dead ends: 122 [2023-12-15 20:55:46,857 INFO L226 Difference]: Without dead ends: 120 [2023-12-15 20:55:46,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2023-12-15 20:55:46,861 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:46,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 213 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:55:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-15 20:55:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2023-12-15 20:55:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 85 states have internal predecessors, (100), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:55:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2023-12-15 20:55:46,874 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 66 [2023-12-15 20:55:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:46,874 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2023-12-15 20:55:46,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 20:55:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2023-12-15 20:55:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-15 20:55:46,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:46,876 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:46,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 20:55:47,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:47,081 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:47,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1562312078, now seen corresponding path program 1 times [2023-12-15 20:55:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915283375] [2023-12-15 20:55:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:47,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:47,111 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:55:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57645117] [2023-12-15 20:55:47,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:47,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:47,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:47,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:55:47,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 20:55:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:47,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 20:55:47,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:55:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 20:55:47,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:55:47,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:47,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915283375] [2023-12-15 20:55:47,279 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:55:47,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57645117] [2023-12-15 20:55:47,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57645117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:47,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:47,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:55:47,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772560830] [2023-12-15 20:55:47,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:47,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:55:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:47,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:55:47,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:55:47,289 INFO L87 Difference]: Start difference. First operand 106 states and 132 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 20:55:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:47,383 INFO L93 Difference]: Finished difference Result 314 states and 390 transitions. [2023-12-15 20:55:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:55:47,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 66 [2023-12-15 20:55:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:47,386 INFO L225 Difference]: With dead ends: 314 [2023-12-15 20:55:47,386 INFO L226 Difference]: Without dead ends: 209 [2023-12-15 20:55:47,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:55:47,390 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 86 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:47,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 297 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:55:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-15 20:55:47,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 137. [2023-12-15 20:55:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 106 states have (on average 1.1415094339622642) internal successors, (121), 106 states have internal predecessors, (121), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-15 20:55:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 169 transitions. [2023-12-15 20:55:47,420 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 169 transitions. Word has length 66 [2023-12-15 20:55:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:47,421 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 169 transitions. [2023-12-15 20:55:47,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 20:55:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2023-12-15 20:55:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-15 20:55:47,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:47,422 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:47,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 20:55:47,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:47,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:47,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash 137609421, now seen corresponding path program 1 times [2023-12-15 20:55:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:47,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563765475] [2023-12-15 20:55:47,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:47,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:47,649 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:55:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327220297] [2023-12-15 20:55:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:47,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:47,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:47,650 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:55:47,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 20:55:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:47,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 20:55:47,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:55:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-15 20:55:47,752 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:55:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563765475] [2023-12-15 20:55:47,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:55:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327220297] [2023-12-15 20:55:47,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327220297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:47,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:47,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:55:47,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580317242] [2023-12-15 20:55:47,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:47,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:55:47,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:47,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:55:47,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:47,755 INFO L87 Difference]: Start difference. First operand 137 states and 169 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:55:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:47,771 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2023-12-15 20:55:47,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:55:47,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-15 20:55:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:47,772 INFO L225 Difference]: With dead ends: 139 [2023-12-15 20:55:47,772 INFO L226 Difference]: Without dead ends: 86 [2023-12-15 20:55:47,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:47,773 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:47,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:55:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-15 20:55:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-15 20:55:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 65 states have internal predecessors, (69), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 20:55:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2023-12-15 20:55:47,782 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 128 [2023-12-15 20:55:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:47,783 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2023-12-15 20:55:47,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-15 20:55:47,783 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2023-12-15 20:55:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-15 20:55:47,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:47,784 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:47,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 20:55:47,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:47,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:47,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2042364363, now seen corresponding path program 1 times [2023-12-15 20:55:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:47,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463889781] [2023-12-15 20:55:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:47,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:48,008 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:55:48,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105404582] [2023-12-15 20:55:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:48,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:48,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:48,010 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:55:48,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 20:55:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:55:48,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:55:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:55:48,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:55:48,183 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:55:48,184 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:55:48,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 20:55:48,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:48,394 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:48,396 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:55:48,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:55:48 BoogieIcfgContainer [2023-12-15 20:55:48,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:55:48,486 INFO L158 Benchmark]: Toolchain (without parser) took 13078.26ms. Allocated memory was 197.1MB in the beginning and 635.4MB in the end (delta: 438.3MB). Free memory was 152.8MB in the beginning and 488.8MB in the end (delta: -336.0MB). Peak memory consumption was 102.8MB. Max. memory is 8.0GB. [2023-12-15 20:55:48,486 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 197.1MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:55:48,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.84ms. Allocated memory is still 197.1MB. Free memory was 152.6MB in the beginning and 140.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:55:48,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.46ms. Allocated memory is still 197.1MB. Free memory was 140.2MB in the beginning and 137.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 20:55:48,487 INFO L158 Benchmark]: Boogie Preprocessor took 48.16ms. Allocated memory is still 197.1MB. Free memory was 137.9MB in the beginning and 135.0MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:55:48,487 INFO L158 Benchmark]: RCFGBuilder took 411.14ms. Allocated memory is still 197.1MB. Free memory was 134.8MB in the beginning and 118.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 20:55:48,487 INFO L158 Benchmark]: TraceAbstraction took 12348.63ms. Allocated memory was 197.1MB in the beginning and 635.4MB in the end (delta: 438.3MB). Free memory was 117.4MB in the beginning and 488.8MB in the end (delta: -371.4MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2023-12-15 20:55:48,488 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71ms. Allocated memory is still 197.1MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.84ms. Allocated memory is still 197.1MB. Free memory was 152.6MB in the beginning and 140.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.46ms. Allocated memory is still 197.1MB. Free memory was 140.2MB in the beginning and 137.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.16ms. Allocated memory is still 197.1MB. Free memory was 137.9MB in the beginning and 135.0MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 411.14ms. Allocated memory is still 197.1MB. Free memory was 134.8MB in the beginning and 118.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 12348.63ms. Allocated memory was 197.1MB in the beginning and 635.4MB in the end (delta: 438.3MB). Free memory was 117.4MB in the beginning and 488.8MB in the end (delta: -371.4MB). Peak memory consumption was 67.1MB. 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] unsigned char var_1_7 = 200; [L24] unsigned char var_1_8 = 4; [L25] signed char var_1_9 = 50; [L26] signed char var_1_12 = -5; [L27] float var_1_13 = 999999999999.8; [L28] float var_1_14 = 100.5; [L29] float var_1_15 = 32.75; [L30] unsigned char var_1_16 = 1; [L31] unsigned char var_1_17 = 1; [L32] unsigned char var_1_18 = 128; [L33] unsigned char last_1_var_1_7 = 200; [L34] signed char last_1_var_1_9 = 50; [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=-5, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_14=201/2, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_15=131/4, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-10, var_1_7=200, var_1_8=0, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_0=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=-272, var_1_7=200, var_1_8=0, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_0=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=200, var_1_8=0, var_1_9=50] [L46] COND TRUE var_1_18 == var_1_18 [L47] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_0=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L49] signed short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_0=50, stepLocal_3=-272, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L50] COND FALSE !(var_1_18 == stepLocal_3) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_0=50, stepLocal_3=-272, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L53] signed short int stepLocal_2 = var_1_1; [L54] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_0=50, stepLocal_1=0, stepLocal_2=-272, stepLocal_3=-272, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L55] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_0=50, stepLocal_1=0, stepLocal_2=-272, stepLocal_3=-272, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L56] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, stepLocal_0=50, stepLocal_1=0, stepLocal_2=-272, stepLocal_3=-272, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L93] RET __VERIFIER_assert(property()) [L94] isInitial = 0 VAL [isInitial=0, last_1_var_1_7=200, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=0, var_1_9=50] [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_7 = var_1_7 [L80] last_1_var_1_9 = var_1_9 [L90] RET updateLastVariables() [L91] CALL updateVariables() [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_9=50] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_9=50] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L67] var_1_12 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L68] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L69] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L69] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L74] var_1_17 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L75] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L76] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L76] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L91] RET updateVariables() [L92] CALL step() [L38] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=-272, var_1_7=0, var_1_8=128, var_1_9=50] [L38] signed long int stepLocal_0 = (last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9; [L39] COND FALSE !(stepLocal_0 < -1) [L42] var_1_1 = (128 - (last_1_var_1_7 + last_1_var_1_7)) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_0=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=128, var_1_7=0, var_1_8=128, var_1_9=50] [L44] var_1_16 = var_1_17 [L45] var_1_18 = var_1_8 VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_0=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=0, var_1_8=128, var_1_9=50] [L46] COND TRUE var_1_18 == var_1_18 [L47] var_1_7 = var_1_8 VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_0=50, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L49] signed short int stepLocal_3 = var_1_1; VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_0=50, stepLocal_3=128, var_1_12=126, var_1_13=4999999999999/5, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L50] COND TRUE var_1_18 == stepLocal_3 [L51] var_1_13 = (var_1_14 - var_1_15) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_0=50, stepLocal_3=128, var_1_12=126, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L53] signed short int stepLocal_2 = var_1_1; [L54] unsigned char stepLocal_1 = (var_1_1 * var_1_18) < -10000; VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_0=50, stepLocal_1=0, stepLocal_2=128, stepLocal_3=128, var_1_12=126, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L55] COND TRUE \read(var_1_16) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_0=50, stepLocal_1=0, stepLocal_2=128, stepLocal_3=128, var_1_12=126, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L56] COND FALSE !(stepLocal_1 && var_1_16) VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, stepLocal_0=50, stepLocal_1=0, stepLocal_2=128, stepLocal_3=128, var_1_12=126, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR last_1_var_1_9 ^ last_1_var_1_9 VAL [isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L83-L84] return ((((((((last_1_var_1_9 ^ last_1_var_1_9) + last_1_var_1_9) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (last_1_var_1_7 + last_1_var_1_7))))) && ((var_1_18 == var_1_18) ? (var_1_7 == ((unsigned char) var_1_8)) : 1)) && (var_1_16 ? ((((var_1_1 * var_1_18) < -10000) && var_1_16) ? ((var_1_1 > var_1_1) ? (var_1_9 == ((signed char) var_1_12)) : 1) : 1) : 1)) && ((var_1_18 == var_1_1) ? (var_1_13 == ((float) (var_1_14 - var_1_15))) : 1)) && (var_1_16 == ((unsigned char) var_1_17))) && (var_1_18 == ((unsigned char) var_1_8)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=0, last_1_var_1_7=0, last_1_var_1_9=50, var_1_12=126, var_1_16=1, var_1_17=1, var_1_18=128, var_1_1=128, var_1_7=128, var_1_8=128, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 418 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417 mSDsluCounter, 1053 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 758 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 295 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 482 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=5, InterpolantAutomatonStates: 47, 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, 6 MinimizatonAttempts, 108 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 509 ConstructedInterpolants, 0 QuantifiedInterpolants, 1917 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1167 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 1174/1180 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 [2023-12-15 20:55:48,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...