/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_operatoramount_amount25_file-53.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 00:24:36,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 00:24:36,804 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-21 00:24:36,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 00:24:36,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 00:24:36,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 00:24:36,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 00:24:36,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 00:24:36,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 00:24:36,849 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 00:24:36,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 00:24:36,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 00:24:36,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 00:24:36,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 00:24:36,852 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 00:24:36,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 00:24:36,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 00:24:36,853 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 00:24:36,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 00:24:36,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 00:24:36,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 00:24:36,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 00:24:36,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 00:24:36,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 00:24:36,855 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 00:24:36,855 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 00:24:36,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 00:24:36,856 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 00:24:36,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 00:24:36,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 00:24:36,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 00:24:36,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 00:24:36,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 00:24:36,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 00:24:36,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 00:24:36,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 00:24:36,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 00:24:36,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 00:24:36,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 00:24:36,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 00:24:36,860 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 00:24:36,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 00:24:36,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 00:24:36,860 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-21 00:24:37,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 00:24:37,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 00:24:37,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 00:24:37,099 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 00:24:37,100 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 00:24:37,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-53.i [2023-12-21 00:24:38,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 00:24:38,542 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 00:24:38,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-53.i [2023-12-21 00:24:38,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/461634f66/3cc6f08969a44266b7b7afce675c5a6a/FLAG3c7cf904b [2023-12-21 00:24:38,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/461634f66/3cc6f08969a44266b7b7afce675c5a6a [2023-12-21 00:24:38,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 00:24:38,574 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 00:24:38,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 00:24:38,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 00:24:38,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 00:24:38,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab5554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38, skipping insertion in model container [2023-12-21 00:24:38,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,605 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 00:24:38,724 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_operatoramount_amount25_file-53.i[915,928] [2023-12-21 00:24:38,755 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 00:24:38,764 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 00:24:38,777 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_operatoramount_amount25_file-53.i[915,928] [2023-12-21 00:24:38,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 00:24:38,819 INFO L206 MainTranslator]: Completed translation [2023-12-21 00:24:38,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38 WrapperNode [2023-12-21 00:24:38,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 00:24:38,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 00:24:38,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 00:24:38,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 00:24:38,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,868 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2023-12-21 00:24:38,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 00:24:38,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 00:24:38,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 00:24:38,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 00:24:38,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,893 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-21 00:24:38,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 00:24:38,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 00:24:38,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 00:24:38,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 00:24:38,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (1/1) ... [2023-12-21 00:24:38,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 00:24:38,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 00:24:38,948 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-21 00:24:38,953 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-21 00:24:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 00:24:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 00:24:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 00:24:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 00:24:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 00:24:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 00:24:39,078 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 00:24:39,082 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 00:24:39,319 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 00:24:39,365 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 00:24:39,365 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 00:24:39,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:24:39 BoogieIcfgContainer [2023-12-21 00:24:39,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 00:24:39,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 00:24:39,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 00:24:39,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 00:24:39,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:24:38" (1/3) ... [2023-12-21 00:24:39,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563835f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:24:39, skipping insertion in model container [2023-12-21 00:24:39,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:24:38" (2/3) ... [2023-12-21 00:24:39,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563835f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:24:39, skipping insertion in model container [2023-12-21 00:24:39,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:24:39" (3/3) ... [2023-12-21 00:24:39,373 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-53.i [2023-12-21 00:24:39,386 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 00:24:39,386 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 00:24:39,423 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 00:24:39,428 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;@425a91ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 00:24:39,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 00:24:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 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-21 00:24:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 00:24:39,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:24:39,443 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-21 00:24:39,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:24:39,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:24:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash 597714362, now seen corresponding path program 1 times [2023-12-21 00:24:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:24:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582842213] [2023-12-21 00:24:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:24:39,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:24:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:24:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:24:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:24:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 00:24:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 00:24:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 00:24:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 00:24:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 00:24:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 00:24:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 00:24:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 00:24:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 00:24:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 00:24:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 00:24:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 00:24:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 00:24:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:39,778 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-21 00:24:39,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:24:39,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582842213] [2023-12-21 00:24:39,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582842213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:24:39,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:24:39,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 00:24:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307591245] [2023-12-21 00:24:39,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:24:39,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 00:24:39,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:24:39,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 00:24:39,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 00:24:39,821 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 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-21 00:24:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:24:39,874 INFO L93 Difference]: Finished difference Result 85 states and 146 transitions. [2023-12-21 00:24:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 00:24:39,877 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-21 00:24:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:24:39,883 INFO L225 Difference]: With dead ends: 85 [2023-12-21 00:24:39,883 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 00:24:39,886 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-21 00:24:39,891 INFO L413 NwaCegarLoop]: 58 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, 58 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-21 00:24:39,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 00:24:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 00:24:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-21 00:24:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-21 00:24:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2023-12-21 00:24:39,933 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 98 [2023-12-21 00:24:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:24:39,934 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2023-12-21 00:24:39,934 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-21 00:24:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2023-12-21 00:24:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 00:24:39,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:24:39,939 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-21 00:24:39,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 00:24:39,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:24:39,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:24:39,940 INFO L85 PathProgramCache]: Analyzing trace with hash 148201394, now seen corresponding path program 1 times [2023-12-21 00:24:39,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:24:39,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403011038] [2023-12-21 00:24:39,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:24:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:24:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:24:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:24:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:24:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 00:24:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 00:24:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 00:24:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 00:24:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 00:24:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 00:24:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 00:24:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 00:24:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 00:24:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 00:24:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 00:24:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 00:24:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 00:24:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2023-12-21 00:24:41,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:24:41,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403011038] [2023-12-21 00:24:41,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403011038] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 00:24:41,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654252816] [2023-12-21 00:24:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:24:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 00:24:41,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 00:24:41,872 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-21 00:24:41,897 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-21 00:24:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:24:42,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-21 00:24:42,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 00:24:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 207 proven. 159 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-12-21 00:24:49,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 00:25:41,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654252816] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 00:25:41,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 00:25:41,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23] total 29 [2023-12-21 00:25:41,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159911694] [2023-12-21 00:25:41,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 00:25:41,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-21 00:25:41,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:25:41,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-21 00:25:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1245, Unknown=3, NotChecked=0, Total=1560 [2023-12-21 00:25:41,326 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 10 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2023-12-21 00:25:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:25:52,520 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2023-12-21 00:25:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-21 00:25:52,521 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 10 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) Word has length 98 [2023-12-21 00:25:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:25:52,523 INFO L225 Difference]: With dead ends: 133 [2023-12-21 00:25:52,523 INFO L226 Difference]: Without dead ends: 92 [2023-12-21 00:25:52,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=641, Invalid=2325, Unknown=4, NotChecked=0, Total=2970 [2023-12-21 00:25:52,526 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 177 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 00:25:52,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 343 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 00:25:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-21 00:25:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 68. [2023-12-21 00:25:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 00:25:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2023-12-21 00:25:52,542 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 98 [2023-12-21 00:25:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:25:52,543 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2023-12-21 00:25:52,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 10 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2023-12-21 00:25:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2023-12-21 00:25:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 00:25:52,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:25:52,546 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-21 00:25:52,557 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-21 00:25:52,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 00:25:52,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:25:52,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:25:52,750 INFO L85 PathProgramCache]: Analyzing trace with hash 205459696, now seen corresponding path program 1 times [2023-12-21 00:25:52,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:25:52,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520120486] [2023-12-21 00:25:52,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:25:52,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:25:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 00:25:52,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 00:25:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 00:25:52,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 00:25:52,986 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 00:25:52,987 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 00:25:52,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 00:25:52,992 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-21 00:25:52,995 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 00:25:53,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 12:25:53 BoogieIcfgContainer [2023-12-21 00:25:53,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 00:25:53,064 INFO L158 Benchmark]: Toolchain (without parser) took 74490.22ms. Allocated memory was 197.1MB in the beginning and 294.6MB in the end (delta: 97.5MB). Free memory was 154.3MB in the beginning and 242.5MB in the end (delta: -88.2MB). Peak memory consumption was 157.0MB. Max. memory is 8.0GB. [2023-12-21 00:25:53,065 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 197.1MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 00:25:53,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.85ms. Allocated memory is still 197.1MB. Free memory was 154.0MB in the beginning and 141.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 00:25:53,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.24ms. Allocated memory is still 197.1MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 00:25:53,066 INFO L158 Benchmark]: Boogie Preprocessor took 36.87ms. Allocated memory is still 197.1MB. Free memory was 139.3MB in the beginning and 136.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 00:25:53,070 INFO L158 Benchmark]: RCFGBuilder took 456.80ms. Allocated memory is still 197.1MB. Free memory was 136.9MB in the beginning and 120.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 00:25:53,070 INFO L158 Benchmark]: TraceAbstraction took 73696.10ms. Allocated memory was 197.1MB in the beginning and 294.6MB in the end (delta: 97.5MB). Free memory was 119.7MB in the beginning and 242.5MB in the end (delta: -122.8MB). Peak memory consumption was 122.4MB. Max. memory is 8.0GB. [2023-12-21 00:25:53,072 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 197.1MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.85ms. Allocated memory is still 197.1MB. Free memory was 154.0MB in the beginning and 141.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.24ms. Allocated memory is still 197.1MB. Free memory was 141.4MB in the beginning and 139.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.87ms. Allocated memory is still 197.1MB. Free memory was 139.3MB in the beginning and 136.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 456.80ms. Allocated memory is still 197.1MB. Free memory was 136.9MB in the beginning and 120.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 73696.10ms. Allocated memory was 197.1MB in the beginning and 294.6MB in the end (delta: 97.5MB). Free memory was 119.7MB in the beginning and 242.5MB in the end (delta: -122.8MB). Peak memory consumption was 122.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 500; [L24] unsigned long int var_1_3 = 1456677701; [L25] unsigned long int var_1_4 = 1000000000; [L26] unsigned long int var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_11 = 0; [L31] float var_1_12 = 128.6; [L32] float var_1_13 = 500.4; [L33] float var_1_14 = 8.5; [L34] double var_1_15 = 255.8; [L35] double var_1_16 = 25.75; [L36] float var_1_17 = 1.2; [L37] float var_1_18 = 9.6; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L62] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L62] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L63] var_1_3 = __VERIFIER_nondet_ulong() [L64] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L64] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L66] var_1_4 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L67] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L68] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L68] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L69] var_1_5 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L71] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L75] var_1_11 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L76] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L77] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L77] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L78] var_1_13 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L79] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L80] var_1_14 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L81] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L82] var_1_16 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L83] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L84] var_1_18 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L85] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L98] RET updateVariables() [L99] CALL step() [L41] var_1_1 = (var_1_2 + (var_1_3 - (var_1_4 - var_1_5))) [L42] var_1_6 = var_1_7 [L43] var_1_12 = ((2.55f + var_1_13) - var_1_14) [L44] var_1_15 = ((((var_1_13) > (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))) ? (var_1_13) : (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) VAL [isInitial=1, var_1_11=1, var_1_13=3221225475, var_1_14=3221225475, var_1_15=3221225475, var_1_16=3221225475, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L45] COND FALSE !(var_1_2 >= var_1_1) VAL [isInitial=1, var_1_11=1, var_1_13=3221225475, var_1_14=3221225475, var_1_15=3221225475, var_1_16=3221225475, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L48] unsigned long int stepLocal_0 = (((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)); VAL [isInitial=1, stepLocal_0=536870911, var_1_11=1, var_1_13=3221225475, var_1_14=3221225475, var_1_15=3221225475, var_1_16=3221225475, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L49] COND FALSE !(((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) != stepLocal_0) [L56] var_1_8 = var_1_11 VAL [isInitial=1, stepLocal_0=536870911, var_1_11=1, var_1_13=3221225475, var_1_14=3221225475, var_1_15=3221225475, var_1_16=3221225475, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=1] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return (((((var_1_1 == ((unsigned long int) (var_1_2 + (var_1_3 - (var_1_4 - var_1_5))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_17 == var_1_12) ? (var_1_6 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && (var_1_12 == ((float) ((2.55f + var_1_13) - var_1_14)))) && (var_1_15 == ((double) ((((var_1_13) > (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))) ? (var_1_13) : (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))))))) && ((var_1_2 >= var_1_1) ? (var_1_17 == ((float) (var_1_14 - ((((var_1_13) > (var_1_18)) ? (var_1_13) : (var_1_18)))))) : 1) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=1, var_1_13=3221225475, var_1_14=3221225475, var_1_15=3221225475, var_1_16=3221225475, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=1, var_1_13=3221225475, var_1_14=3221225475, var_1_15=3221225475, var_1_16=3221225475, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.6s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 401 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 291 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 674 IncrementalHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 110 mSDtfsCounter, 674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 36.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=2, InterpolantAutomatonStates: 35, 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, 2 MinimizatonAttempts, 24 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 61.0s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 4221 SizeOfPredicates, 12 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1137/1440 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-21 00:25:53,104 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...