/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-65.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:18:46,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:18:46,667 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:18:46,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:18:46,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:18:46,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:18:46,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:18:46,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:18:46,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:18:46,695 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:18:46,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:18:46,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:18:46,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:18:46,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:18:46,696 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:18:46,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:18:46,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:18:46,697 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:18:46,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:18:46,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:18:46,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:18:46,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:18:46,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:18:46,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:18:46,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:18:46,704 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:18:46,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:18:46,705 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:18:46,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:18:46,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:18:46,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:18:46,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:18:46,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:18:46,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:18:46,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:18:46,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:18:46,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:18:46,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:18:46,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:18:46,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:18:46,707 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:18:46,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:18:46,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:18:46,708 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:18:46,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:18:46,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:18:46,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:18:46,909 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:18:46,911 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:18:46,912 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-65.i [2023-12-20 22:18:47,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:18:48,159 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:18:48,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2023-12-20 22:18:48,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19327267e/fd5e317ae7244dfa8b7495a80cc4510e/FLAG860fc688e [2023-12-20 22:18:48,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19327267e/fd5e317ae7244dfa8b7495a80cc4510e [2023-12-20 22:18:48,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:18:48,182 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:18:48,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:18:48,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:18:48,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:18:48,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b02001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48, skipping insertion in model container [2023-12-20 22:18:48,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,204 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:18:48,325 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-65.i[916,929] [2023-12-20 22:18:48,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:18:48,378 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:18:48,390 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-65.i[916,929] [2023-12-20 22:18:48,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:18:48,425 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:18:48,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48 WrapperNode [2023-12-20 22:18:48,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:18:48,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:18:48,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:18:48,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:18:48,431 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:18:48" (1/1) ... [2023-12-20 22:18:48,445 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:18:48" (1/1) ... [2023-12-20 22:18:48,472 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2023-12-20 22:18:48,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:18:48,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:18:48,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:18:48,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:18:48,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,499 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:18:48,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:18:48,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:18:48,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:18:48,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:18:48,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (1/1) ... [2023-12-20 22:18:48,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:18:48,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:18:48,569 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:18:48,597 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:18:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:18:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:18:48,615 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:18:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:18:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:18:48,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:18:48,670 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:18:48,673 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:18:48,840 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:18:48,887 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:18:48,887 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:18:48,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:18:48 BoogieIcfgContainer [2023-12-20 22:18:48,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:18:48,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:18:48,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:18:48,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:18:48,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:18:48" (1/3) ... [2023-12-20 22:18:48,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60968227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:18:48, skipping insertion in model container [2023-12-20 22:18:48,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:18:48" (2/3) ... [2023-12-20 22:18:48,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60968227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:18:48, skipping insertion in model container [2023-12-20 22:18:48,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:18:48" (3/3) ... [2023-12-20 22:18:48,894 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-65.i [2023-12-20 22:18:48,906 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:18:48,906 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:18:48,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:18:48,950 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;@77304bb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:18:48,950 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:18:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:18:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-20 22:18:48,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:18:48,960 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:48,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:18:48,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:18:48,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1059842933, now seen corresponding path program 1 times [2023-12-20 22:18:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:18:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168190004] [2023-12-20 22:18:48,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:18:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:18:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:18:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:18:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:18:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:18:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:18:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:18:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:18:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:18:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:18:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:18:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:18:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:18:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:18:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:18:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:18:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:18:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:18:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:18:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168190004] [2023-12-20 22:18:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168190004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:18:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:18:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 22:18:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353324017] [2023-12-20 22:18:49,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:18:49,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 22:18:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:18:49,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 22:18:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:18:49,264 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 22:18:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:18:49,314 INFO L93 Difference]: Finished difference Result 85 states and 150 transitions. [2023-12-20 22:18:49,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 22:18:49,317 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2023-12-20 22:18:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:18:49,323 INFO L225 Difference]: With dead ends: 85 [2023-12-20 22:18:49,323 INFO L226 Difference]: Without dead ends: 42 [2023-12-20 22:18:49,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 22:18:49,331 INFO L413 NwaCegarLoop]: 59 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, 59 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 22:18:49,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:18:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-20 22:18:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-20 22:18:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 22:18:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2023-12-20 22:18:49,376 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 98 [2023-12-20 22:18:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:18:49,376 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2023-12-20 22:18:49,377 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 22:18:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2023-12-20 22:18:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-20 22:18:49,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:18:49,379 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:49,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:18:49,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:18:49,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:18:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1330050187, now seen corresponding path program 1 times [2023-12-20 22:18:49,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:18:49,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257097102] [2023-12-20 22:18:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:18:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:18:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:18:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:18:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:18:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:18:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:18:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:18:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:18:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:18:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:18:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:18:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:18:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:18:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:18:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 22:18:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 22:18:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 22:18:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:18:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 22:18:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:18:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257097102] [2023-12-20 22:18:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257097102] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:18:51,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:18:51,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 22:18:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872383186] [2023-12-20 22:18:51,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:18:51,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 22:18:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:18:51,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 22:18:51,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-20 22:18:51,134 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:18:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:18:51,306 INFO L93 Difference]: Finished difference Result 106 states and 152 transitions. [2023-12-20 22:18:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 22:18:51,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2023-12-20 22:18:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:18:51,310 INFO L225 Difference]: With dead ends: 106 [2023-12-20 22:18:51,310 INFO L226 Difference]: Without dead ends: 65 [2023-12-20 22:18:51,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-12-20 22:18:51,312 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 34 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:18:51,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 227 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:18:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-20 22:18:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2023-12-20 22:18:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-20 22:18:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2023-12-20 22:18:51,338 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 98 [2023-12-20 22:18:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:18:51,339 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2023-12-20 22:18:51,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 22:18:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2023-12-20 22:18:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-20 22:18:51,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:18:51,354 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:51,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:18:51,354 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:18:51,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:18:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1566471563, now seen corresponding path program 1 times [2023-12-20 22:18:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:18:51,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717875300] [2023-12-20 22:18:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:18:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:18:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:18:51,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 22:18:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:18:51,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 22:18:51,456 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 22:18:51,456 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:18:51,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 22:18:51,460 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-20 22:18:51,462 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:18:51,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:18:51 BoogieIcfgContainer [2023-12-20 22:18:51,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:18:51,501 INFO L158 Benchmark]: Toolchain (without parser) took 3319.06ms. Allocated memory was 335.5MB in the beginning and 402.7MB in the end (delta: 67.1MB). Free memory was 292.4MB in the beginning and 364.3MB in the end (delta: -71.8MB). Peak memory consumption was 186.5MB. Max. memory is 8.0GB. [2023-12-20 22:18:51,501 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:18:51,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.95ms. Allocated memory is still 335.5MB. Free memory was 292.4MB in the beginning and 279.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 22:18:51,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.29ms. Allocated memory is still 335.5MB. Free memory was 279.8MB in the beginning and 277.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 22:18:51,502 INFO L158 Benchmark]: Boogie Preprocessor took 45.09ms. Allocated memory is still 335.5MB. Free memory was 277.8MB in the beginning and 275.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 22:18:51,502 INFO L158 Benchmark]: RCFGBuilder took 369.32ms. Allocated memory is still 335.5MB. Free memory was 275.0MB in the beginning and 258.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 22:18:51,502 INFO L158 Benchmark]: TraceAbstraction took 2611.08ms. Allocated memory was 335.5MB in the beginning and 402.7MB in the end (delta: 67.1MB). Free memory was 257.4MB in the beginning and 364.3MB in the end (delta: -106.9MB). Peak memory consumption was 151.9MB. Max. memory is 8.0GB. [2023-12-20 22:18:51,504 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 205.5MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.95ms. Allocated memory is still 335.5MB. Free memory was 292.4MB in the beginning and 279.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.29ms. Allocated memory is still 335.5MB. Free memory was 279.8MB in the beginning and 277.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.09ms. Allocated memory is still 335.5MB. Free memory was 277.8MB in the beginning and 275.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 369.32ms. Allocated memory is still 335.5MB. Free memory was 275.0MB in the beginning and 258.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2611.08ms. Allocated memory was 335.5MB in the beginning and 402.7MB in the end (delta: 67.1MB). Free memory was 257.4MB in the beginning and 364.3MB in the end (delta: -106.9MB). Peak memory consumption was 151.9MB. 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 to_int at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000000; [L23] unsigned char var_1_3 = 1; [L24] signed long int var_1_4 = 8; [L25] signed long int var_1_5 = -32; [L26] signed long int var_1_9 = 100; [L27] signed long int var_1_12 = 25; [L28] signed long int var_1_13 = 63; [L29] signed long int var_1_14 = 0; [L30] signed long int var_1_15 = 0; [L31] signed char var_1_16 = -8; [L32] signed char var_1_17 = 8; [L33] unsigned short int var_1_18 = 2; [L34] unsigned short int var_1_19 = 50; [L35] unsigned short int var_1_20 = 0; [L36] signed long int last_1_var_1_9 = 100; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_9 = var_1_9 [L100] RET updateLastVariables() [L101] CALL updateVariables() [L64] var_1_3 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L66] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L66] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L67] var_1_4 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L68] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L69] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L69] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L70] var_1_12 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L71] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L72] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L73] var_1_13 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L74] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L75] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L76] var_1_14 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L77] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L78] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L78] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L79] var_1_15 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L80] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L81] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L81] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L82] var_1_17 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L83] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L84] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L84] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L85] var_1_19 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L86] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L87] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=0, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=0, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L87] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=0, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L101] RET updateVariables() [L102] CALL step() [L40] COND FALSE !(0.625f > last_1_var_1_9) [L45] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=0, var_1_1=4, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L47] var_1_16 = var_1_17 [L48] var_1_18 = var_1_19 [L49] var_1_20 = var_1_19 VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=0, var_1_1=4, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L50] COND TRUE \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=0, var_1_1=4, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32, var_1_9=100] [L51] COND TRUE var_1_20 >= ((var_1_18 - var_1_20) * 64) [L52] var_1_9 = (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=0, var_1_1=4, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-32] [L59] COND TRUE var_1_4 > var_1_9 [L60] var_1_5 = (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=0, var_1_1=4, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-2, var_1_9=3] [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return ((((((0.625f > last_1_var_1_9) ? (var_1_3 ? (var_1_1 == ((signed long int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : (var_1_1 == ((signed long int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && ((var_1_4 > var_1_9) ? (var_1_5 == ((signed long int) (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)))) : 1)) && (var_1_3 ? ((var_1_20 >= ((var_1_18 - var_1_20) * 64)) ? (var_1_9 == ((signed long int) (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13))) : 1) : ((var_1_1 <= var_1_1) ? (var_1_9 == ((signed long int) (var_1_13 - (var_1_14 - var_1_15)))) : 1))) && (var_1_16 == ((signed char) var_1_17))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((unsigned short int) var_1_19)) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=0, var_1_1=4, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-2, var_1_9=3] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=0, var_1_19=0, var_1_1=4, var_1_20=0, var_1_3=1, var_1_4=4, var_1_5=-2, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 286 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 122 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 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:18:51,540 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...