/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_no-floats_file-29.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:09:27,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:09:27,519 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 22:09:27,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:09:27,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:09:27,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:09:27,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:09:27,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:09:27,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:09:27,538 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:09:27,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:09:27,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:09:27,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:09:27,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:09:27,539 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:09:27,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:09:27,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:09:27,540 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:09:27,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:09:27,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:09:27,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:09:27,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:09:27,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:09:27,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:09:27,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:09:27,542 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:09:27,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:09:27,542 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:09:27,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:09:27,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:09:27,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:09:27,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:09:27,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:09:27,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:09:27,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:09:27,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:09:27,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:09:27,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:09:27,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:09:27,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:09:27,544 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:09:27,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:09:27,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:09:27,545 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 22:09:27,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:09:27,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:09:27,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:09:27,760 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:09:27,760 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:09:27,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-29.i [2023-12-20 22:09:28,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:09:28,803 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:09:28,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-29.i [2023-12-20 22:09:28,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b8994dd4/5f7e6fb5d8e84e8c8d661bfc693de4b1/FLAGa0e6b27dd [2023-12-20 22:09:28,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b8994dd4/5f7e6fb5d8e84e8c8d661bfc693de4b1 [2023-12-20 22:09:28,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:09:28,820 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:09:28,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:09:28,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:09:28,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:09:28,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:09:28" (1/1) ... [2023-12-20 22:09:28,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698c6179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:28, skipping insertion in model container [2023-12-20 22:09:28,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:09:28" (1/1) ... [2023-12-20 22:09:28,839 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:09:28,939 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_no-floats_file-29.i[916,929] [2023-12-20 22:09:28,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:09:28,993 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:09:29,002 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_no-floats_file-29.i[916,929] [2023-12-20 22:09:29,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:09:29,039 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:09:29,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29 WrapperNode [2023-12-20 22:09:29,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:09:29,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:09:29,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:09:29,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:09:29,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,091 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2023-12-20 22:09:29,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:09:29,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:09:29,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:09:29,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:09:29,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,119 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 22:09:29,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:09:29,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:09:29,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:09:29,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:09:29,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (1/1) ... [2023-12-20 22:09:29,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:09:29,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:09:29,171 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 22:09:29,183 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 22:09:29,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:09:29,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:09:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:09:29,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:09:29,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:09:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:09:29,243 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:09:29,244 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:09:29,410 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:09:29,449 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:09:29,449 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:09:29,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:09:29 BoogieIcfgContainer [2023-12-20 22:09:29,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:09:29,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:09:29,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:09:29,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:09:29,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:09:28" (1/3) ... [2023-12-20 22:09:29,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8f034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:09:29, skipping insertion in model container [2023-12-20 22:09:29,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:09:29" (2/3) ... [2023-12-20 22:09:29,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8f034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:09:29, skipping insertion in model container [2023-12-20 22:09:29,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:09:29" (3/3) ... [2023-12-20 22:09:29,461 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-29.i [2023-12-20 22:09:29,472 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:09:29,472 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:09:29,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:09:29,507 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;@2f1e3784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:09:29,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:09:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-20 22:09:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-20 22:09:29,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:09:29,530 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:09:29,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:09:29,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:09:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash -960659490, now seen corresponding path program 1 times [2023-12-20 22:09:29,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:09:29,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253418069] [2023-12-20 22:09:29,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:09:29,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:09:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:29,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:09:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:29,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:09:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:29,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:09:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:29,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:09:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:29,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:09:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:29,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:09:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:29,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:09:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:29,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:09:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-20 22:09:29,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:09:29,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253418069] [2023-12-20 22:09:29,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253418069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:09:29,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:09:29,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:09:29,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198942976] [2023-12-20 22:09:29,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:09:29,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:09:29,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:09:29,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:09:29,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:09:29,860 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-20 22:09:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:09:29,917 INFO L93 Difference]: Finished difference Result 73 states and 122 transitions. [2023-12-20 22:09:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:09:29,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 54 [2023-12-20 22:09:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:09:29,924 INFO L225 Difference]: With dead ends: 73 [2023-12-20 22:09:29,924 INFO L226 Difference]: Without dead ends: 41 [2023-12-20 22:09:29,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 22:09:29,928 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:09:29,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:09:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-20 22:09:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2023-12-20 22:09:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-20 22:09:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2023-12-20 22:09:29,953 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 54 [2023-12-20 22:09:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:09:29,953 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2023-12-20 22:09:29,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-20 22:09:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2023-12-20 22:09:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-20 22:09:29,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:09:29,955 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:09:29,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:09:29,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:09:29,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:09:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash -649515868, now seen corresponding path program 1 times [2023-12-20 22:09:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:09:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915813558] [2023-12-20 22:09:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:09:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:09:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:09:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:09:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:09:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:09:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:09:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:09:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:09:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:09:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-20 22:09:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:09:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915813558] [2023-12-20 22:09:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915813558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:09:30,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:09:30,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:09:30,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728524239] [2023-12-20 22:09:30,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:09:30,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:09:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:09:30,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:09:30,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:09:30,097 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-20 22:09:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:09:30,130 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2023-12-20 22:09:30,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:09:30,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2023-12-20 22:09:30,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:09:30,132 INFO L225 Difference]: With dead ends: 74 [2023-12-20 22:09:30,133 INFO L226 Difference]: Without dead ends: 41 [2023-12-20 22:09:30,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 22:09:30,135 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:09:30,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 74 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:09:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-20 22:09:30,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2023-12-20 22:09:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-20 22:09:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2023-12-20 22:09:30,149 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 55 [2023-12-20 22:09:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:09:30,150 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2023-12-20 22:09:30,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-20 22:09:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2023-12-20 22:09:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-20 22:09:30,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:09:30,153 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:09:30,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:09:30,154 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:09:30,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:09:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash -649456286, now seen corresponding path program 1 times [2023-12-20 22:09:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:09:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246220764] [2023-12-20 22:09:30,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:09:30,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:09:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:09:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:09:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:09:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:09:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:09:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:09:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:09:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:09:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-20 22:09:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:09:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246220764] [2023-12-20 22:09:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246220764] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:09:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180482637] [2023-12-20 22:09:30,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:09:30,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:09:30,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:09:30,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 22:09:30,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 22:09:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:30,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 22:09:30,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:09:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-20 22:09:30,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 22:09:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-20 22:09:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180482637] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 22:09:30,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 22:09:30,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-20 22:09:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723688117] [2023-12-20 22:09:30,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 22:09:30,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 22:09:30,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:09:30,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 22:09:30,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-20 22:09:30,783 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 22:09:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:09:30,952 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2023-12-20 22:09:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 22:09:30,952 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 55 [2023-12-20 22:09:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:09:30,963 INFO L225 Difference]: With dead ends: 74 [2023-12-20 22:09:30,964 INFO L226 Difference]: Without dead ends: 40 [2023-12-20 22:09:30,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2023-12-20 22:09:30,966 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 74 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:09:30,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 67 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:09:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-20 22:09:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2023-12-20 22:09:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-20 22:09:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2023-12-20 22:09:30,978 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 55 [2023-12-20 22:09:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:09:30,979 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-12-20 22:09:30,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 22:09:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2023-12-20 22:09:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-20 22:09:30,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:09:30,980 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:09:30,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 22:09:31,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:09:31,188 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:09:31,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:09:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash -124482502, now seen corresponding path program 1 times [2023-12-20 22:09:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:09:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234486608] [2023-12-20 22:09:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:09:31,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:09:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:31,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:09:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:09:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:09:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:09:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:31,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:09:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:31,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:09:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:09:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:09:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:09:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-20 22:09:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:09:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234486608] [2023-12-20 22:09:31,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234486608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:09:31,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:09:31,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:09:31,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308543885] [2023-12-20 22:09:31,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:09:31,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:09:31,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:09:31,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:09:31,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:09:31,252 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-20 22:09:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:09:31,272 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2023-12-20 22:09:31,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:09:31,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2023-12-20 22:09:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:09:31,273 INFO L225 Difference]: With dead ends: 76 [2023-12-20 22:09:31,273 INFO L226 Difference]: Without dead ends: 39 [2023-12-20 22:09:31,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 22:09:31,279 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:09:31,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:09:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-20 22:09:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2023-12-20 22:09:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-20 22:09:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2023-12-20 22:09:31,291 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 55 [2023-12-20 22:09:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:09:31,292 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-12-20 22:09:31,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-20 22:09:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2023-12-20 22:09:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-20 22:09:31,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:09:31,298 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:09:31,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 22:09:31,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:09:31,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:09:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash -124422920, now seen corresponding path program 1 times [2023-12-20 22:09:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:09:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730840427] [2023-12-20 22:09:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:09:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:09:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:09:31,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 22:09:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:09:31,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 22:09:31,384 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 22:09:31,384 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:09:31,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 22:09:31,387 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-20 22:09:31,389 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:09:31,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:09:31 BoogieIcfgContainer [2023-12-20 22:09:31,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:09:31,432 INFO L158 Benchmark]: Toolchain (without parser) took 2612.99ms. Allocated memory is still 392.2MB. Free memory was 351.2MB in the beginning and 321.3MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-20 22:09:31,433 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 218.1MB. Free memory is still 167.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:09:31,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.87ms. Allocated memory is still 392.2MB. Free memory was 350.8MB in the beginning and 338.6MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-20 22:09:31,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.88ms. Allocated memory is still 392.2MB. Free memory was 338.6MB in the beginning and 336.2MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 22:09:31,433 INFO L158 Benchmark]: Boogie Preprocessor took 46.87ms. Allocated memory is still 392.2MB. Free memory was 336.2MB in the beginning and 332.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 22:09:31,433 INFO L158 Benchmark]: RCFGBuilder took 309.27ms. Allocated memory is still 392.2MB. Free memory was 332.6MB in the beginning and 317.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-20 22:09:31,433 INFO L158 Benchmark]: TraceAbstraction took 1975.51ms. Allocated memory is still 392.2MB. Free memory was 316.9MB in the beginning and 321.3MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:09:31,434 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 218.1MB. Free memory is still 167.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.87ms. Allocated memory is still 392.2MB. Free memory was 350.8MB in the beginning and 338.6MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.88ms. Allocated memory is still 392.2MB. Free memory was 338.6MB in the beginning and 336.2MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.87ms. Allocated memory is still 392.2MB. Free memory was 336.2MB in the beginning and 332.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 309.27ms. Allocated memory is still 392.2MB. Free memory was 332.6MB in the beginning and 317.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1975.51ms. Allocated memory is still 392.2MB. Free memory was 316.9MB in the beginning and 321.3MB in the end (delta: -4.4MB). There was no memory consumed. 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 78, overapproximation of someBinaryFLOATComparisonOperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 2; [L23] signed long int var_1_3 = 9; [L24] signed long int var_1_4 = 3; [L25] unsigned short int var_1_5 = 32; [L26] unsigned short int var_1_9 = 1; [L27] unsigned char var_1_10 = 8; [L28] unsigned char var_1_11 = 5; [L29] unsigned char var_1_12 = 1; [L30] unsigned char var_1_13 = 1; [L31] unsigned char var_1_14 = 8; [L82] isInitial = 1 [L83] FCALL initially() [L84] COND TRUE 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L62] var_1_3 = __VERIFIER_nondet_long() [L63] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=3, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=3, var_1_5=32, var_1_9=1] [L63] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=3, var_1_5=32, var_1_9=1] [L64] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=3, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=3, var_1_5=32, var_1_9=1] [L64] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=3, var_1_5=32, var_1_9=1] [L65] var_1_4 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L66] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L67] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L68] var_1_11 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L69] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L70] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L71] var_1_13 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L72] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L73] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L86] RET updateVariables() [L87] CALL step() [L35] var_1_12 = var_1_13 [L36] var_1_14 = var_1_11 VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=254, var_1_1=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L37] COND TRUE \read(var_1_12) [L38] var_1_1 = var_1_3 VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=254, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=32, var_1_9=1] [L44] COND TRUE (var_1_1 + 8.125) > (var_1_1 * var_1_3) [L45] var_1_5 = (((((var_1_14 + var_1_14)) > (var_1_14)) ? ((var_1_14 + var_1_14)) : (var_1_14))) VAL [isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=254, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=508, var_1_9=1] [L49] signed long int stepLocal_0 = 5 * var_1_14; VAL [isInitial=1, stepLocal_0=1270, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=254, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=508, var_1_9=1] [L50] COND TRUE ((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1 VAL [isInitial=1, stepLocal_0=1270, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=254, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=508, var_1_9=1] [L51] COND FALSE !(var_1_14 > stepLocal_0) VAL [isInitial=1, stepLocal_0=1270, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=254, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=508, var_1_9=1] [L57] COND FALSE !(var_1_1 < var_1_3) VAL [isInitial=1, stepLocal_0=1270, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=254, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=508, var_1_9=1] [L87] RET step() [L88] CALL, EXPR property() [L78-L79] return (((((var_1_12 ? (var_1_1 == ((signed long int) var_1_3)) : ((! (var_1_3 < var_1_4)) ? (var_1_1 == ((signed long int) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1)) && (((var_1_1 + 8.125) > (var_1_1 * var_1_3)) ? (var_1_5 == ((unsigned short int) (((((var_1_14 + var_1_14)) > (var_1_14)) ? ((var_1_14 + var_1_14)) : (var_1_14))))) : (var_1_5 == ((unsigned short int) var_1_14)))) && ((((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) ? ((var_1_14 > (5 * var_1_14)) ? ((var_1_1 < (var_1_1 * 256.5f)) ? (var_1_9 == ((unsigned short int) var_1_14)) : 1) : 1) : 1)) && ((var_1_1 < var_1_3) ? (var_1_10 == ((unsigned char) var_1_11)) : 1)) && (var_1_12 == ((unsigned char) var_1_13))) && (var_1_14 == ((unsigned char) var_1_11)) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=254, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=508, var_1_9=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=8, var_1_11=254, var_1_12=1, var_1_13=1, var_1_14=254, var_1_1=0, var_1_3=0, var_1_4=0, var_1_5=508, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 267 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 144 mSDtfsCounter, 113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 176 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 509 SizeOfPredicates, 4 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 663/672 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 22:09:31,450 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...