/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_floatingpointinfluence_has-floats_file-73.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 10:35:11,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 10:35:11,346 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-19 10:35:11,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 10:35:11,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 10:35:11,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 10:35:11,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 10:35:11,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 10:35:11,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 10:35:11,392 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 10:35:11,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 10:35:11,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 10:35:11,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 10:35:11,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 10:35:11,398 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 10:35:11,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 10:35:11,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 10:35:11,400 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 10:35:11,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 10:35:11,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 10:35:11,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 10:35:11,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 10:35:11,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 10:35:11,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 10:35:11,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 10:35:11,402 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 10:35:11,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 10:35:11,402 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 10:35:11,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 10:35:11,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 10:35:11,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 10:35:11,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 10:35:11,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:35:11,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 10:35:11,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 10:35:11,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 10:35:11,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 10:35:11,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 10:35:11,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 10:35:11,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 10:35:11,409 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 10:35:11,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 10:35:11,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 10:35:11,410 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-19 10:35:11,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 10:35:11,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 10:35:11,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 10:35:11,682 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 10:35:11,682 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 10:35:11,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i [2023-12-19 10:35:12,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 10:35:13,185 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 10:35:13,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i [2023-12-19 10:35:13,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5093908/44d02d5bb0484bdc97764cf16617058b/FLAG1e7443883 [2023-12-19 10:35:13,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e5093908/44d02d5bb0484bdc97764cf16617058b [2023-12-19 10:35:13,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 10:35:13,208 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 10:35:13,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 10:35:13,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 10:35:13,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 10:35:13,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f28476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13, skipping insertion in model container [2023-12-19 10:35:13,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,253 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 10:35:13,407 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_floatingpointinfluence_has-floats_file-73.i[917,930] [2023-12-19 10:35:13,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:35:13,472 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 10:35:13,481 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_floatingpointinfluence_has-floats_file-73.i[917,930] [2023-12-19 10:35:13,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:35:13,515 INFO L206 MainTranslator]: Completed translation [2023-12-19 10:35:13,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13 WrapperNode [2023-12-19 10:35:13,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 10:35:13,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 10:35:13,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 10:35:13,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 10:35:13,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,585 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-12-19 10:35:13,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 10:35:13,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 10:35:13,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 10:35:13,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 10:35:13,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,627 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-19 10:35:13,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 10:35:13,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 10:35:13,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 10:35:13,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 10:35:13,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (1/1) ... [2023-12-19 10:35:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:35:13,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:35:13,702 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-19 10:35:13,725 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-19 10:35:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 10:35:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 10:35:13,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 10:35:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 10:35:13,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 10:35:13,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 10:35:13,837 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 10:35:13,841 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 10:35:14,099 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 10:35:14,143 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 10:35:14,144 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 10:35:14,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:35:14 BoogieIcfgContainer [2023-12-19 10:35:14,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 10:35:14,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 10:35:14,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 10:35:14,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 10:35:14,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 10:35:13" (1/3) ... [2023-12-19 10:35:14,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afe1994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:35:14, skipping insertion in model container [2023-12-19 10:35:14,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:35:13" (2/3) ... [2023-12-19 10:35:14,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afe1994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:35:14, skipping insertion in model container [2023-12-19 10:35:14,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:35:14" (3/3) ... [2023-12-19 10:35:14,155 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-73.i [2023-12-19 10:35:14,172 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 10:35:14,173 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 10:35:14,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 10:35:14,229 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;@3dbbff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 10:35:14,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 10:35:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 10:35:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-19 10:35:14,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:35:14,254 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:35:14,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:35:14,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:35:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2061904121, now seen corresponding path program 1 times [2023-12-19 10:35:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:35:14,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471902726] [2023-12-19 10:35:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:35:14,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:35:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:35:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:35:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:35:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 10:35:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:35:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 10:35:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:35:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 10:35:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 10:35:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 10:35:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 10:35:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 10:35:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 10:35:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 10:35:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 10:35:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 10:35:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:35:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471902726] [2023-12-19 10:35:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471902726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:35:14,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:35:14,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 10:35:14,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140493895] [2023-12-19 10:35:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:35:14,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 10:35:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:35:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 10:35:14,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 10:35:14,617 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-19 10:35:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:35:14,668 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2023-12-19 10:35:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 10:35:14,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2023-12-19 10:35:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:35:14,677 INFO L225 Difference]: With dead ends: 89 [2023-12-19 10:35:14,678 INFO L226 Difference]: Without dead ends: 44 [2023-12-19 10:35:14,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 10:35:14,685 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:35:14,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:35:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-19 10:35:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-19 10:35:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 10:35:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2023-12-19 10:35:14,724 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 94 [2023-12-19 10:35:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:35:14,724 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2023-12-19 10:35:14,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-19 10:35:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2023-12-19 10:35:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-19 10:35:14,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:35:14,729 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:35:14,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 10:35:14,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:35:14,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:35:14,734 INFO L85 PathProgramCache]: Analyzing trace with hash 709628301, now seen corresponding path program 1 times [2023-12-19 10:35:14,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:35:14,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545854716] [2023-12-19 10:35:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:35:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:35:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:35:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:35:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:35:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 10:35:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:35:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 10:35:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:35:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 10:35:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 10:35:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 10:35:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 10:35:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 10:35:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 10:35:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 10:35:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 10:35:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 10:35:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:35:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545854716] [2023-12-19 10:35:15,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545854716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:35:15,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:35:15,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:35:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47097133] [2023-12-19 10:35:15,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:35:15,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:35:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:35:15,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:35:15,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:35:15,285 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 10:35:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:35:15,333 INFO L93 Difference]: Finished difference Result 87 states and 129 transitions. [2023-12-19 10:35:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:35:15,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2023-12-19 10:35:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:35:15,335 INFO L225 Difference]: With dead ends: 87 [2023-12-19 10:35:15,335 INFO L226 Difference]: Without dead ends: 44 [2023-12-19 10:35:15,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-19 10:35:15,337 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:35:15,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:35:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-19 10:35:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-19 10:35:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 10:35:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2023-12-19 10:35:15,355 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 94 [2023-12-19 10:35:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:35:15,358 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2023-12-19 10:35:15,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 10:35:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2023-12-19 10:35:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-19 10:35:15,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:35:15,366 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:35:15,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 10:35:15,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:35:15,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:35:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash 514105839, now seen corresponding path program 1 times [2023-12-19 10:35:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:35:15,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097504980] [2023-12-19 10:35:15,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:35:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:35:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:35:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:35:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:35:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 10:35:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:35:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 10:35:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:35:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 10:35:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 10:35:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 10:35:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 10:35:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 10:35:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 10:35:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 10:35:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 10:35:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:35:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-19 10:35:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:35:15,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097504980] [2023-12-19 10:35:15,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097504980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:35:15,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:35:15,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:35:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978446417] [2023-12-19 10:35:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:35:15,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:35:15,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:35:15,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:35:15,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:35:15,526 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 10:35:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:35:15,580 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2023-12-19 10:35:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:35:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2023-12-19 10:35:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:35:15,585 INFO L225 Difference]: With dead ends: 99 [2023-12-19 10:35:15,585 INFO L226 Difference]: Without dead ends: 56 [2023-12-19 10:35:15,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-19 10:35:15,589 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:35:15,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:35:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-19 10:35:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2023-12-19 10:35:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-19 10:35:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2023-12-19 10:35:15,603 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 95 [2023-12-19 10:35:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:35:15,604 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2023-12-19 10:35:15,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-19 10:35:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2023-12-19 10:35:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-19 10:35:15,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:35:15,605 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:35:15,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 10:35:15,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:35:15,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:35:15,606 INFO L85 PathProgramCache]: Analyzing trace with hash 514165421, now seen corresponding path program 1 times [2023-12-19 10:35:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:35:15,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198422143] [2023-12-19 10:35:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:35:15,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:35:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 10:35:15,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 10:35:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 10:35:15,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 10:35:15,768 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 10:35:15,769 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 10:35:15,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 10:35:15,776 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-19 10:35:15,780 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 10:35:15,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 10:35:15 BoogieIcfgContainer [2023-12-19 10:35:15,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 10:35:15,874 INFO L158 Benchmark]: Toolchain (without parser) took 2666.10ms. Allocated memory was 205.5MB in the beginning and 312.5MB in the end (delta: 107.0MB). Free memory was 141.5MB in the beginning and 207.6MB in the end (delta: -66.1MB). Peak memory consumption was 41.4MB. Max. memory is 8.0GB. [2023-12-19 10:35:15,874 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 205.5MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 10:35:15,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.38ms. Allocated memory is still 205.5MB. Free memory was 141.3MB in the beginning and 128.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 10:35:15,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.09ms. Allocated memory was 205.5MB in the beginning and 312.5MB in the end (delta: 107.0MB). Free memory was 128.5MB in the beginning and 279.2MB in the end (delta: -150.7MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2023-12-19 10:35:15,876 INFO L158 Benchmark]: Boogie Preprocessor took 71.30ms. Allocated memory is still 312.5MB. Free memory was 279.2MB in the beginning and 275.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 10:35:15,876 INFO L158 Benchmark]: RCFGBuilder took 486.11ms. Allocated memory is still 312.5MB. Free memory was 275.0MB in the beginning and 256.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 10:35:15,876 INFO L158 Benchmark]: TraceAbstraction took 1726.57ms. Allocated memory is still 312.5MB. Free memory was 255.6MB in the beginning and 207.6MB in the end (delta: 48.0MB). Peak memory consumption was 47.4MB. Max. memory is 8.0GB. [2023-12-19 10:35:15,878 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.13ms. Allocated memory is still 205.5MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.38ms. Allocated memory is still 205.5MB. Free memory was 141.3MB in the beginning and 128.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.09ms. Allocated memory was 205.5MB in the beginning and 312.5MB in the end (delta: 107.0MB). Free memory was 128.5MB in the beginning and 279.2MB in the end (delta: -150.7MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.30ms. Allocated memory is still 312.5MB. Free memory was 279.2MB in the beginning and 275.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 486.11ms. Allocated memory is still 312.5MB. Free memory was 275.0MB in the beginning and 256.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 1726.57ms. Allocated memory is still 312.5MB. Free memory was 255.6MB in the beginning and 207.6MB in the end (delta: 48.0MB). Peak memory consumption was 47.4MB. 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 someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someUnaryDOUBLEoperation at line 24. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] unsigned char var_1_6 = 1; [L24] double var_1_7 = -0.41; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] float var_1_12 = 15.75; [L29] float var_1_13 = 1.6; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] float var_1_16 = 16.5; [L33] signed char var_1_17 = 10; [L34] signed char var_1_18 = -10; [L35] signed long int var_1_19 = -16; [L36] float last_1_var_1_12 = 15.75; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] last_1_var_1_12 = var_1_12 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L75] var_1_7 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L76] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L79] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L84] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L85] var_1_14 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L86] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L87] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L88] var_1_15 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L89] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L90] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L91] var_1_16 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L92] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L93] var_1_18 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L94] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L95] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=0] [L109] RET updateVariables() [L110] CALL step() [L40] COND TRUE \read(var_1_6) [L41] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L48] COND FALSE !(var_1_19 > var_1_9) [L59] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L61] signed long int stepLocal_0 = (((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))); VAL [isInitial=1, last_1_var_1_12=63/4, stepLocal_0=0, var_1_10=0, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=63/4, stepLocal_0=0, var_1_10=0, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=0, var_1_1=11/2, var_1_6=1, var_1_8=0, var_1_9=0] [L63] COND FALSE !(! var_1_6) [L66] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=63/4, stepLocal_0=0, var_1_10=0, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=0, var_1_1=132, var_1_6=1, var_1_7=132, var_1_8=0, var_1_9=0] [L69] var_1_17 = var_1_18 [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return (((((var_1_8 <= ((((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))))) ? ((! var_1_6) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((last_1_var_1_12 < (last_1_var_1_12 + var_1_7)) ? (var_1_8 == ((unsigned char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1))) && ((var_1_19 > var_1_9) ? (var_1_6 ? (var_1_12 == ((float) (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((var_1_14 && var_1_15) ? (var_1_12 == ((float) (var_1_13 - var_1_16))) : (var_1_12 == ((float) var_1_16)))) : (var_1_12 == ((float) var_1_13)))) && (var_1_17 == ((signed char) var_1_18))) && (var_1_19 == ((signed long int) var_1_8)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=132, var_1_6=1, var_1_7=132, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=63/4, var_1_10=0, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=132, var_1_6=1, var_1_7=132, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 286 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 181 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1260/1260 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-19 10:35:15,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...