./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4caff26fc73638e5f12efd7078239ddc60605dcfb854b96620a2374df91a448f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:33:36,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:33:36,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:33:36,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:33:36,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:33:36,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:33:36,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:33:36,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:33:36,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:33:36,095 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:33:36,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:33:36,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:33:36,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:33:36,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:33:36,097 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:33:36,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:33:36,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:33:36,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:33:36,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:33:36,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:33:36,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:33:36,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:33:36,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:33:36,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:33:36,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:33:36,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:33:36,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:33:36,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:33:36,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:33:36,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:33:36,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:33:36,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:33:36,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:33:36,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:33:36,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:33:36,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:33:36,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:33:36,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:33:36,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:33:36,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:33:36,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:33:36,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:33:36,107 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4caff26fc73638e5f12efd7078239ddc60605dcfb854b96620a2374df91a448f [2024-10-24 09:33:36,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:33:36,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:33:36,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:33:36,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:33:36,342 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:33:36,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i [2024-10-24 09:33:37,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:33:37,702 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:33:37,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i [2024-10-24 09:33:37,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3db844ed/0cb8bb32bb234bea9614aeb6388bd828/FLAG3653ef3e3 [2024-10-24 09:33:37,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3db844ed/0cb8bb32bb234bea9614aeb6388bd828 [2024-10-24 09:33:37,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:33:37,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:33:37,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:33:37,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:33:37,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:33:37,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:37,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57db3795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37, skipping insertion in model container [2024-10-24 09:33:37,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:37,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:33:37,865 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i[915,928] [2024-10-24 09:33:37,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:33:37,900 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:33:37,909 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i[915,928] [2024-10-24 09:33:37,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:33:37,938 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:33:37,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37 WrapperNode [2024-10-24 09:33:37,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:33:37,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:33:37,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:33:37,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:33:37,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:37,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:37,993 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-24 09:33:37,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:33:37,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:33:37,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:33:37,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:33:38,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:38,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:38,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:38,018 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]. [2024-10-24 09:33:38,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:38,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:38,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:38,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:38,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:38,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:38,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:33:38,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:33:38,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:33:38,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:33:38,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (1/1) ... [2024-10-24 09:33:38,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:33:38,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:33:38,064 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) [2024-10-24 09:33:38,066 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 [2024-10-24 09:33:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:33:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:33:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:33:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:33:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:33:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:33:38,190 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:33:38,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:33:38,396 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 09:33:38,396 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:33:38,437 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:33:38,438 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:33:38,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:38 BoogieIcfgContainer [2024-10-24 09:33:38,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:33:38,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:33:38,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:33:38,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:33:38,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:33:37" (1/3) ... [2024-10-24 09:33:38,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da75a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:38, skipping insertion in model container [2024-10-24 09:33:38,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:37" (2/3) ... [2024-10-24 09:33:38,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da75a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:38, skipping insertion in model container [2024-10-24 09:33:38,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:38" (3/3) ... [2024-10-24 09:33:38,447 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-10.i [2024-10-24 09:33:38,461 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:33:38,462 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:33:38,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:33:38,526 INFO L333 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, 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;@702e9e93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:33:38,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:33:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:33:38,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:33:38,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:33:38,543 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:33:38,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:33:38,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:33:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1432935190, now seen corresponding path program 1 times [2024-10-24 09:33:38,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:33:38,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337717661] [2024-10-24 09:33:38,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:33:38,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:33:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:33:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:33:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:33:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:33:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:33:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:33:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 09:33:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 09:33:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 09:33:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 09:33:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 09:33:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:33:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:33:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 09:33:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 09:33:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 09:33:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:33:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:33:38,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:33:38,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337717661] [2024-10-24 09:33:38,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337717661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:33:38,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:33:38,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:33:38,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188390794] [2024-10-24 09:33:38,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:33:38,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:33:38,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:33:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:33:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:33:38,888 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:33:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:33:38,913 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2024-10-24 09:33:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:33:38,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2024-10-24 09:33:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:33:38,919 INFO L225 Difference]: With dead ends: 89 [2024-10-24 09:33:38,920 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 09:33:38,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:33:38,925 INFO L432 NwaCegarLoop]: 61 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, 61 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 [2024-10-24 09:33:38,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:33:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 09:33:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 09:33:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:33:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2024-10-24 09:33:38,996 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 104 [2024-10-24 09:33:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:33:38,996 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2024-10-24 09:33:38,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:33:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2024-10-24 09:33:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:33:38,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:33:38,998 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:33:38,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:33:38,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:33:39,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:33:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1679398756, now seen corresponding path program 1 times [2024-10-24 09:33:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:33:39,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357724742] [2024-10-24 09:33:39,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:33:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:33:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:33:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:33:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:33:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:33:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:33:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:33:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 09:33:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 09:33:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 09:33:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 09:33:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 09:33:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:33:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:33:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 09:33:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 09:33:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 09:33:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:33:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:33:39,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:33:39,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357724742] [2024-10-24 09:33:39,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357724742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:33:39,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:33:39,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:33:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629309238] [2024-10-24 09:33:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:33:39,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:33:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:33:39,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:33:39,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:33:39,458 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:33:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:33:39,487 INFO L93 Difference]: Finished difference Result 87 states and 127 transitions. [2024-10-24 09:33:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:33:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2024-10-24 09:33:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:33:39,490 INFO L225 Difference]: With dead ends: 87 [2024-10-24 09:33:39,491 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 09:33:39,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:33:39,493 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:33:39,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:33:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 09:33:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 09:33:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:33:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-10-24 09:33:39,504 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 104 [2024-10-24 09:33:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:33:39,507 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-10-24 09:33:39,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:33:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-10-24 09:33:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 09:33:39,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:33:39,509 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:33:39,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:33:39,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:33:39,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:33:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash 521545361, now seen corresponding path program 1 times [2024-10-24 09:33:39,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:33:39,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059753945] [2024-10-24 09:33:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:33:39,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:33:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:33:39,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799519359] [2024-10-24 09:33:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:33:39,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:33:39,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:33:39,587 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) [2024-10-24 09:33:39,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:33:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:33:39,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:33:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:33:39,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:33:39,856 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:33:39,857 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:33:39,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 09:33:40,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:33:40,062 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 09:33:40,129 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:33:40,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:33:40 BoogieIcfgContainer [2024-10-24 09:33:40,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:33:40,134 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:33:40,134 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:33:40,135 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:33:40,135 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:38" (3/4) ... [2024-10-24 09:33:40,136 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:33:40,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:33:40,138 INFO L158 Benchmark]: Toolchain (without parser) took 2415.46ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 98.6MB in the beginning and 180.6MB in the end (delta: -82.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:33:40,138 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 163.6MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:33:40,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.55ms. Allocated memory is still 163.6MB. Free memory was 98.4MB in the beginning and 84.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:33:40,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.56ms. Allocated memory is still 163.6MB. Free memory was 84.2MB in the beginning and 137.5MB in the end (delta: -53.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:33:40,140 INFO L158 Benchmark]: Boogie Preprocessor took 38.70ms. Allocated memory is still 163.6MB. Free memory was 137.5MB in the beginning and 134.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:33:40,140 INFO L158 Benchmark]: RCFGBuilder took 402.38ms. Allocated memory is still 163.6MB. Free memory was 134.4MB in the beginning and 114.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:33:40,140 INFO L158 Benchmark]: TraceAbstraction took 1693.17ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 114.2MB in the beginning and 181.7MB in the end (delta: -67.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:33:40,140 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 230.7MB. Free memory was 181.7MB in the beginning and 180.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:33:40,142 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.12ms. Allocated memory is still 163.6MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.55ms. Allocated memory is still 163.6MB. Free memory was 98.4MB in the beginning and 84.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.56ms. Allocated memory is still 163.6MB. Free memory was 84.2MB in the beginning and 137.5MB in the end (delta: -53.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.70ms. Allocated memory is still 163.6MB. Free memory was 137.5MB in the beginning and 134.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 402.38ms. Allocated memory is still 163.6MB. Free memory was 134.4MB in the beginning and 114.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1693.17ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 114.2MB in the beginning and 181.7MB in the end (delta: -67.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 230.7MB. Free memory was 181.7MB in the beginning and 180.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 8; [L24] double var_1_3 = 9.15; [L25] double var_1_6 = 1000000.875; [L26] double var_1_7 = 49.25; [L27] double var_1_8 = 1000000000.8; [L28] double var_1_9 = 7.85; [L29] double var_1_10 = 15.5; [L30] double var_1_11 = 49.875; [L31] unsigned char var_1_12 = 4; [L32] unsigned char var_1_13 = 0; [L33] unsigned short int var_1_14 = 42290; [L34] unsigned short int var_1_15 = 2; [L35] unsigned char var_1_16 = 32; [L36] double var_1_17 = 64.4; [L37] signed long int var_1_18 = 0; [L38] signed char var_1_19 = -1; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L70] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L70] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L71] var_1_6 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L72] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_7=197/4, var_1_8=5000000004/5, var_1_9=157/20] [L73] var_1_7 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_8=5000000004/5, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_8=5000000004/5, var_1_9=157/20] [L74] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_8=5000000004/5, var_1_9=157/20] [L75] var_1_8 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_9=157/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_9=157/20] [L76] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20, var_1_9=157/20] [L77] var_1_9 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L78] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=31/2, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L79] var_1_10 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L80] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=399/8, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L81] var_1_11 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L82] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L84] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=4, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L85] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L85] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=42290, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L86] var_1_14 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L87] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L88] CALL assume_abort_if_not(var_1_14 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L88] RET assume_abort_if_not(var_1_14 <= 65535) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=2, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L89] var_1_15 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L90] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L91] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L91] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L92] CALL assume_abort_if_not(var_1_15 != 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L92] RET assume_abort_if_not(var_1_15 != 32767) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=32, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L93] var_1_16 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L94] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L95] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=0, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=0, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L95] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=0, var_1_17=322/5, var_1_18=0, var_1_19=-1, var_1_1=5, var_1_2=0, var_1_3=183/20] [L108] RET updateVariables() [L109] CALL step() [L42] var_1_17 = (var_1_8 + var_1_9) [L43] var_1_18 = var_1_15 [L44] var_1_19 = 8 [L45] unsigned long int stepLocal_1 = var_1_2; VAL [isInitial=1, stepLocal_1=0, var_1_12=4, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=0, var_1_18=1, var_1_19=8, var_1_1=5, var_1_2=0, var_1_3=183/20] [L46] COND FALSE !(\read(var_1_13)) [L53] var_1_12 = var_1_16 VAL [isInitial=1, stepLocal_1=0, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=0, var_1_18=1, var_1_19=8, var_1_1=5, var_1_2=0, var_1_3=183/20] [L55] var_1_1 = var_1_12 [L56] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=0, var_1_18=1, var_1_19=8, var_1_1=0, var_1_2=0, var_1_3=183/20] [L57] COND FALSE !(stepLocal_0 < var_1_1) VAL [isInitial=1, stepLocal_1=0, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=0, var_1_18=1, var_1_19=8, var_1_1=0, var_1_2=0, var_1_3=183/20] [L60] COND TRUE (- var_1_17) == (var_1_6 - var_1_7) [L61] var_1_3 = (var_1_8 + (var_1_9 - ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) VAL [isInitial=1, stepLocal_1=0, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=0, var_1_18=1, var_1_19=8, var_1_1=0, var_1_2=0] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return (((((var_1_1 == ((unsigned long int) var_1_12)) && ((var_1_12 < var_1_1) ? (var_1_3 == ((double) -0.5)) : (((- var_1_17) == (var_1_6 - var_1_7)) ? (var_1_3 == ((double) (var_1_8 + (var_1_9 - ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))))) : (var_1_3 == ((double) 50.125))))) && (var_1_13 ? (((var_1_18 / (var_1_14 - var_1_15)) <= var_1_2) ? (var_1_12 == ((unsigned char) var_1_16)) : (var_1_12 == ((unsigned char) 16))) : (var_1_12 == ((unsigned char) var_1_16)))) && (var_1_17 == ((double) (var_1_8 + var_1_9)))) && (var_1_18 == ((signed long int) var_1_15))) && (var_1_19 == ((signed char) 8)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=0, var_1_18=1, var_1_19=8, var_1_1=0, var_1_2=0] [L19] reach_error() VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=1, var_1_16=0, var_1_18=1, var_1_19=8, var_1_1=0, var_1_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 120 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1088 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 [2024-10-24 09:33:40,170 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4caff26fc73638e5f12efd7078239ddc60605dcfb854b96620a2374df91a448f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:33:41,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:33:42,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:33:42,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:33:42,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:33:42,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:33:42,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:33:42,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:33:42,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:33:42,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:33:42,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:33:42,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:33:42,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:33:42,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:33:42,081 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:33:42,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:33:42,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:33:42,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:33:42,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:33:42,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:33:42,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:33:42,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:33:42,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:33:42,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:33:42,085 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:33:42,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:33:42,085 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:33:42,085 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:33:42,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:33:42,086 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:33:42,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:33:42,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:33:42,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:33:42,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:33:42,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:33:42,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:33:42,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:33:42,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:33:42,087 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:33:42,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:33:42,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:33:42,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:33:42,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:33:42,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:33:42,090 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:33:42,090 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4caff26fc73638e5f12efd7078239ddc60605dcfb854b96620a2374df91a448f [2024-10-24 09:33:42,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:33:42,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:33:42,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:33:42,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:33:42,353 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:33:42,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i [2024-10-24 09:33:43,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:33:43,807 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:33:43,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i [2024-10-24 09:33:43,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1460a1277/fb930150bc7e4fe784b45fb9098d6b91/FLAGb6167e15e [2024-10-24 09:33:44,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1460a1277/fb930150bc7e4fe784b45fb9098d6b91 [2024-10-24 09:33:44,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:33:44,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:33:44,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:33:44,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:33:44,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:33:44,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c80ebff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44, skipping insertion in model container [2024-10-24 09:33:44,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:33:44,378 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i[915,928] [2024-10-24 09:33:44,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:33:44,438 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:33:44,448 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-10.i[915,928] [2024-10-24 09:33:44,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:33:44,497 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:33:44,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44 WrapperNode [2024-10-24 09:33:44,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:33:44,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:33:44,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:33:44,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:33:44,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,545 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-24 09:33:44,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:33:44,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:33:44,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:33:44,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:33:44,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,580 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]. [2024-10-24 09:33:44,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:33:44,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:33:44,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:33:44,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:33:44,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (1/1) ... [2024-10-24 09:33:44,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:33:44,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:33:44,634 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) [2024-10-24 09:33:44,641 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 [2024-10-24 09:33:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:33:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:33:44,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:33:44,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:33:44,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:33:44,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:33:44,755 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:33:44,757 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:33:48,036 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 09:33:48,037 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:33:48,090 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:33:48,091 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:33:48,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:48 BoogieIcfgContainer [2024-10-24 09:33:48,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:33:48,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:33:48,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:33:48,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:33:48,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:33:44" (1/3) ... [2024-10-24 09:33:48,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248f0b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:48, skipping insertion in model container [2024-10-24 09:33:48,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:33:44" (2/3) ... [2024-10-24 09:33:48,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248f0b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:33:48, skipping insertion in model container [2024-10-24 09:33:48,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:33:48" (3/3) ... [2024-10-24 09:33:48,099 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-10.i [2024-10-24 09:33:48,112 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:33:48,112 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:33:48,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:33:48,166 INFO L333 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, 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;@212b465f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:33:48,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:33:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:33:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:33:48,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:33:48,180 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:33:48,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:33:48,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:33:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1432935190, now seen corresponding path program 1 times [2024-10-24 09:33:48,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:33:48,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289915228] [2024-10-24 09:33:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:33:48,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:33:48,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:33:48,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:33:48,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:33:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:48,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:33:48,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:33:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-24 09:33:48,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:33:48,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:33:48,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289915228] [2024-10-24 09:33:48,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289915228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:33:48,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:33:48,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:33:48,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370530492] [2024-10-24 09:33:48,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:33:48,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:33:48,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:33:48,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:33:48,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:33:48,629 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:33:51,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:33:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:33:51,039 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2024-10-24 09:33:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:33:51,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2024-10-24 09:33:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:33:51,074 INFO L225 Difference]: With dead ends: 89 [2024-10-24 09:33:51,074 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 09:33:51,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:33:51,080 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:33:51,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 09:33:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 09:33:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 09:33:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:33:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2024-10-24 09:33:51,114 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 104 [2024-10-24 09:33:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:33:51,115 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2024-10-24 09:33:51,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:33:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2024-10-24 09:33:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 09:33:51,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:33:51,119 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:33:51,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:33:51,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:33:51,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:33:51,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:33:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1679398756, now seen corresponding path program 1 times [2024-10-24 09:33:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:33:51,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843329800] [2024-10-24 09:33:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:33:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:33:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:33:51,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:33:51,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:33:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:51,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 09:33:51,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:33:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:33:51,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:33:51,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:33:51,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843329800] [2024-10-24 09:33:51,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843329800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:33:51,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:33:51,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:33:51,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249787739] [2024-10-24 09:33:51,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:33:51,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:33:51,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:33:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:33:51,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:33:51,882 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:33:54,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:33:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:33:54,226 INFO L93 Difference]: Finished difference Result 87 states and 127 transitions. [2024-10-24 09:33:54,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:33:54,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2024-10-24 09:33:54,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:33:54,255 INFO L225 Difference]: With dead ends: 87 [2024-10-24 09:33:54,255 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 09:33:54,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:33:54,257 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:33:54,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 09:33:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 09:33:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 09:33:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:33:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-10-24 09:33:54,264 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 104 [2024-10-24 09:33:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:33:54,266 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-10-24 09:33:54,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:33:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-10-24 09:33:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 09:33:54,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:33:54,268 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:33:54,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 09:33:54,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:33:54,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:33:54,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:33:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash 521545361, now seen corresponding path program 1 times [2024-10-24 09:33:54,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:33:54,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116911513] [2024-10-24 09:33:54,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:33:54,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:33:54,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:33:54,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:33:54,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:33:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:54,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 09:33:54,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:34:26,979 WARN L286 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:34:33,318 WARN L286 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:34:40,866 WARN L286 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:34:48,970 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:34:57,070 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:35:03,777 WARN L286 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:35:10,807 WARN L286 SmtUtils]: Spent 7.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:35:17,689 WARN L286 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)