/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-15.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 21:54:26,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 21:54:26,683 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-20 21:54:26,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 21:54:26,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 21:54:26,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 21:54:26,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 21:54:26,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 21:54:26,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 21:54:26,701 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 21:54:26,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 21:54:26,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 21:54:26,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 21:54:26,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 21:54:26,702 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 21:54:26,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 21:54:26,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 21:54:26,703 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 21:54:26,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 21:54:26,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 21:54:26,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 21:54:26,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 21:54:26,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 21:54:26,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 21:54:26,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 21:54:26,705 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 21:54:26,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 21:54:26,705 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 21:54:26,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 21:54:26,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 21:54:26,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 21:54:26,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 21:54:26,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:54:26,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 21:54:26,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 21:54:26,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 21:54:26,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 21:54:26,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 21:54:26,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 21:54:26,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 21:54:26,707 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 21:54:26,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 21:54:26,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 21:54:26,707 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 -> false [2023-12-20 21:54:26,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 21:54:26,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 21:54:26,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 21:54:26,871 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 21:54:26,871 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 21:54:26,872 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-15.i [2023-12-20 21:54:27,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 21:54:28,178 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 21:54:28,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-15.i [2023-12-20 21:54:28,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1041b6f6f/7336b6181e5f4e3fa0ea1db1c54dd077/FLAG0c3d63f1e [2023-12-20 21:54:28,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1041b6f6f/7336b6181e5f4e3fa0ea1db1c54dd077 [2023-12-20 21:54:28,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 21:54:28,201 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 21:54:28,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 21:54:28,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 21:54:28,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 21:54:28,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161e1f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28, skipping insertion in model container [2023-12-20 21:54:28,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,222 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 21:54:28,307 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-15.i[917,930] [2023-12-20 21:54:28,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:54:28,334 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 21:54:28,341 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-15.i[917,930] [2023-12-20 21:54:28,352 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 21:54:28,362 INFO L206 MainTranslator]: Completed translation [2023-12-20 21:54:28,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28 WrapperNode [2023-12-20 21:54:28,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 21:54:28,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 21:54:28,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 21:54:28,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 21:54:28,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,385 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-12-20 21:54:28,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 21:54:28,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 21:54:28,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 21:54:28,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 21:54:28,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,402 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-20 21:54:28,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 21:54:28,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 21:54:28,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 21:54:28,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 21:54:28,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (1/1) ... [2023-12-20 21:54:28,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 21:54:28,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 21:54:28,486 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-20 21:54:28,536 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-20 21:54:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 21:54:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 21:54:28,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 21:54:28,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 21:54:28,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 21:54:28,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 21:54:28,633 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 21:54:28,635 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 21:54:28,779 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 21:54:28,808 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 21:54:28,808 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 21:54:28,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:54:28 BoogieIcfgContainer [2023-12-20 21:54:28,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 21:54:28,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 21:54:28,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 21:54:28,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 21:54:28,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 09:54:28" (1/3) ... [2023-12-20 21:54:28,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52062dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:54:28, skipping insertion in model container [2023-12-20 21:54:28,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:54:28" (2/3) ... [2023-12-20 21:54:28,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52062dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:54:28, skipping insertion in model container [2023-12-20 21:54:28,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:54:28" (3/3) ... [2023-12-20 21:54:28,814 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-15.i [2023-12-20 21:54:28,827 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 21:54:28,827 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 21:54:28,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 21:54:28,865 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;@404bffdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 21:54:28,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 21:54:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-20 21:54:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-20 21:54:28,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:54:28,877 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 21:54:28,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:54:28,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:54:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1285337844, now seen corresponding path program 1 times [2023-12-20 21:54:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:54:28,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919083627] [2023-12-20 21:54:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:54:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:54:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:54:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:54:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:54:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:54:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:54:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:54:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:54:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:54:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:54:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 21:54:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:54:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 21:54:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-20 21:54:29,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:54:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919083627] [2023-12-20 21:54:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919083627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:54:29,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:54:29,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 21:54:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626791247] [2023-12-20 21:54:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:54:29,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 21:54:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:54:29,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 21:54:29,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 21:54:29,166 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 21:54:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:54:29,200 INFO L93 Difference]: Finished difference Result 77 states and 130 transitions. [2023-12-20 21:54:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 21:54:29,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2023-12-20 21:54:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:54:29,208 INFO L225 Difference]: With dead ends: 77 [2023-12-20 21:54:29,208 INFO L226 Difference]: Without dead ends: 38 [2023-12-20 21:54:29,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-20 21:54:29,212 INFO L413 NwaCegarLoop]: 51 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, 51 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-20 21:54:29,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:54:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-20 21:54:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-20 21:54:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-20 21:54:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2023-12-20 21:54:29,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 78 [2023-12-20 21:54:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:54:29,252 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2023-12-20 21:54:29,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-20 21:54:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2023-12-20 21:54:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-20 21:54:29,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:54:29,254 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 21:54:29,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 21:54:29,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:54:29,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:54:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1063438060, now seen corresponding path program 1 times [2023-12-20 21:54:29,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:54:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389360799] [2023-12-20 21:54:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:54:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:54:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:54:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:54:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:54:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:54:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:54:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:54:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:54:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:54:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:54:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 21:54:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:54:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 21:54:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-20 21:54:29,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:54:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389360799] [2023-12-20 21:54:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389360799] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:54:29,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:54:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 21:54:29,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129560651] [2023-12-20 21:54:29,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:54:29,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 21:54:29,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:54:29,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 21:54:29,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-20 21:54:29,663 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-20 21:54:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:54:29,713 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2023-12-20 21:54:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 21:54:29,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-12-20 21:54:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:54:29,716 INFO L225 Difference]: With dead ends: 87 [2023-12-20 21:54:29,716 INFO L226 Difference]: Without dead ends: 50 [2023-12-20 21:54:29,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-20 21:54:29,719 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 11 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:54:29,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 144 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:54:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-20 21:54:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2023-12-20 21:54:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-20 21:54:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2023-12-20 21:54:29,725 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 78 [2023-12-20 21:54:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:54:29,726 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2023-12-20 21:54:29,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-20 21:54:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2023-12-20 21:54:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-20 21:54:29,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:54:29,731 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 21:54:29,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 21:54:29,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:54:29,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:54:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2029098796, now seen corresponding path program 1 times [2023-12-20 21:54:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:54:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449415651] [2023-12-20 21:54:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:54:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:54:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 21:54:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 21:54:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 21:54:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 21:54:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 21:54:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 21:54:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 21:54:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 21:54:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 21:54:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 21:54:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 21:54:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 21:54:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 21:54:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-20 21:54:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 21:54:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449415651] [2023-12-20 21:54:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449415651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 21:54:29,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 21:54:29,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 21:54:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834807068] [2023-12-20 21:54:29,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 21:54:29,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 21:54:29,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 21:54:29,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 21:54:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 21:54:29,882 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-20 21:54:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 21:54:29,922 INFO L93 Difference]: Finished difference Result 119 states and 167 transitions. [2023-12-20 21:54:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 21:54:29,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-12-20 21:54:29,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 21:54:29,925 INFO L225 Difference]: With dead ends: 119 [2023-12-20 21:54:29,925 INFO L226 Difference]: Without dead ends: 79 [2023-12-20 21:54:29,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-20 21:54:29,928 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 27 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 21:54:29,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 107 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 21:54:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-20 21:54:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2023-12-20 21:54:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-20 21:54:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2023-12-20 21:54:29,946 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 78 [2023-12-20 21:54:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 21:54:29,947 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2023-12-20 21:54:29,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-20 21:54:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2023-12-20 21:54:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-20 21:54:29,951 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 21:54:29,952 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 21:54:29,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 21:54:29,952 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 21:54:29,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 21:54:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1802169699, now seen corresponding path program 1 times [2023-12-20 21:54:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 21:54:29,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213975727] [2023-12-20 21:54:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 21:54:29,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 21:54:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:54:30,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 21:54:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 21:54:30,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 21:54:30,122 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 21:54:30,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 21:54:30,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 21:54:30,126 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-20 21:54:30,129 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 21:54:30,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 09:54:30 BoogieIcfgContainer [2023-12-20 21:54:30,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 21:54:30,186 INFO L158 Benchmark]: Toolchain (without parser) took 1984.77ms. Allocated memory is still 295.7MB. Free memory was 242.8MB in the beginning and 129.0MB in the end (delta: 113.8MB). Peak memory consumption was 114.4MB. Max. memory is 8.0GB. [2023-12-20 21:54:30,186 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory was 137.5MB in the beginning and 137.4MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 21:54:30,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.31ms. Allocated memory is still 295.7MB. Free memory was 242.5MB in the beginning and 230.2MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 21:54:30,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.37ms. Allocated memory is still 295.7MB. Free memory was 230.2MB in the beginning and 228.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 21:54:30,189 INFO L158 Benchmark]: Boogie Preprocessor took 24.65ms. Allocated memory is still 295.7MB. Free memory was 228.2MB in the beginning and 225.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 21:54:30,191 INFO L158 Benchmark]: RCFGBuilder took 397.91ms. Allocated memory is still 295.7MB. Free memory was 225.8MB in the beginning and 209.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 21:54:30,191 INFO L158 Benchmark]: TraceAbstraction took 1375.45ms. Allocated memory is still 295.7MB. Free memory was 208.5MB in the beginning and 129.0MB in the end (delta: 79.5MB). Peak memory consumption was 79.8MB. Max. memory is 8.0GB. [2023-12-20 21:54:30,194 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.10ms. Allocated memory is still 187.7MB. Free memory was 137.5MB in the beginning and 137.4MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 160.31ms. Allocated memory is still 295.7MB. Free memory was 242.5MB in the beginning and 230.2MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.37ms. Allocated memory is still 295.7MB. Free memory was 230.2MB in the beginning and 228.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.65ms. Allocated memory is still 295.7MB. Free memory was 228.2MB in the beginning and 225.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 397.91ms. Allocated memory is still 295.7MB. Free memory was 225.8MB in the beginning and 209.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 1375.45ms. Allocated memory is still 295.7MB. Free memory was 208.5MB in the beginning and 129.0MB in the end (delta: 79.5MB). Peak memory consumption was 79.8MB. 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 91, overapproximation of someBinaryArithmeticDOUBLEoperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_7 = 8; [L26] unsigned long int var_1_8 = 1; [L27] unsigned long int var_1_9 = 1885310857; [L28] signed long int var_1_10 = -10; [L29] double var_1_11 = 32.6; [L30] double var_1_12 = 9.75; [L31] double var_1_13 = 5.1; [L32] double var_1_14 = 128.1; [L33] double var_1_15 = 63.9; [L34] signed long int last_1_var_1_10 = -10; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_10 = var_1_10 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L67] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L68] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L68] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L75] var_1_9 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_9 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L76] RET assume_abort_if_not(var_1_9 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L77] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L78] var_1_12 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L79] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L80] var_1_13 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L81] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L82] var_1_14 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L83] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L84] var_1_15 = __VERIFIER_nondet_double() [L85] 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_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L85] 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_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L99] RET updateVariables() [L100] CALL step() [L38] COND TRUE \read(var_1_2) [L39] var_1_8 = ((1514707036u + ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) - last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L43] COND TRUE \read(var_1_2) [L44] var_1_10 = (var_1_8 + ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_11=163/5, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L46] unsigned char stepLocal_1 = var_1_2; [L47] signed long int stepLocal_0 = var_1_10; VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-1706518424, stepLocal_1=1, var_1_10=-1706518424, var_1_11=163/5, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L48] COND TRUE stepLocal_1 || ((~ var_1_10) >= var_1_10) VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-1706518424, stepLocal_1=1, var_1_10=-1706518424, var_1_11=163/5, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L49] COND FALSE !(stepLocal_0 < var_1_8) [L54] var_1_1 = 2 VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-1706518424, stepLocal_1=1, var_1_10=-1706518424, var_1_11=163/5, var_1_1=2, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L59] COND TRUE var_1_1 >= var_1_1 [L60] var_1_11 = (var_1_12 - (((((var_1_13 + var_1_14)) > (var_1_15)) ? ((var_1_13 + var_1_14)) : (var_1_15)))) VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-1706518424, stepLocal_1=1, var_1_10=-1706518424, var_1_1=2, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L100] RET step() [L101] CALL, EXPR property() [L91-L92] return ((((var_1_2 || ((~ var_1_10) >= var_1_10)) ? ((var_1_10 < var_1_8) ? ((! var_1_6) ? (var_1_1 == ((signed char) var_1_7)) : 1) : (var_1_1 == ((signed char) 2))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_2 ? (var_1_8 == ((unsigned long int) ((1514707036u + ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) - last_1_var_1_10))) : (var_1_8 == ((unsigned long int) ((((last_1_var_1_10) > (var_1_9)) ? (last_1_var_1_10) : (var_1_9))))))) && (var_1_2 ? (var_1_10 == ((signed long int) (var_1_8 + ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))))) : 1)) && ((var_1_1 >= var_1_1) ? (var_1_11 == ((double) (var_1_12 - (((((var_1_13 + var_1_14)) > (var_1_15)) ? ((var_1_13 + var_1_14)) : (var_1_15)))))) : (var_1_11 == ((double) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13)))))) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_1=2, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_1=2, var_1_2=1, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 302 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 164 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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-20 21:54:30,227 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...