./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.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 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:17:45,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:17:45,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:17:45,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:17:45,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:17:45,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:17:45,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:17:45,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:17:45,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:17:45,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:17:45,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:17:45,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:17:45,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:17:45,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:17:45,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:17:45,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:17:45,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:17:45,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:17:45,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:17:45,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:17:45,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:17:45,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:17:45,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:17:45,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:17:45,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:17:45,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:17:45,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:17:45,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:17:45,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:17:45,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:17:45,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:17:45,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:17:45,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:17:45,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:17:45,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:17:45,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:17:45,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:17:45,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:17:45,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:17:45,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:17:45,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:17:45,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:17:45,951 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 -> 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad [2024-11-09 01:17:46,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:17:46,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:17:46,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:17:46,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:17:46,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:17:46,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i [2024-11-09 01:17:47,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:17:47,896 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:17:47,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i [2024-11-09 01:17:47,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9df9e73/f24853f474a745ec96a8bb2dfb08e142/FLAG9d8c320c9 [2024-11-09 01:17:47,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9df9e73/f24853f474a745ec96a8bb2dfb08e142 [2024-11-09 01:17:47,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:17:47,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:17:47,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:17:47,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:17:47,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:17:47,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:17:47" (1/1) ... [2024-11-09 01:17:47,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64885268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:47, skipping insertion in model container [2024-11-09 01:17:47,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:17:47" (1/1) ... [2024-11-09 01:17:47,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:17:48,166 WARN L250 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_variablewrapping_normal_file-21.i[913,926] [2024-11-09 01:17:48,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:17:48,220 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:17:48,236 WARN L250 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_variablewrapping_normal_file-21.i[913,926] [2024-11-09 01:17:48,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:17:48,271 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:17:48,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48 WrapperNode [2024-11-09 01:17:48,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:17:48,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:17:48,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:17:48,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:17:48,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,315 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-09 01:17:48,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:17:48,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:17:48,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:17:48,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:17:48,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,354 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-11-09 01:17:48,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:17:48,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:17:48,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:17:48,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:17:48,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (1/1) ... [2024-11-09 01:17:48,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:17:48,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:17:48,424 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-11-09 01:17:48,431 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-11-09 01:17:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:17:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:17:48,479 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:17:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:17:48,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:17:48,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:17:48,558 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:17:48,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:17:48,789 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 01:17:48,790 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:17:48,810 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:17:48,811 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:17:48,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:48 BoogieIcfgContainer [2024-11-09 01:17:48,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:17:48,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:17:48,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:17:48,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:17:48,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:17:47" (1/3) ... [2024-11-09 01:17:48,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da134df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:17:48, skipping insertion in model container [2024-11-09 01:17:48,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:17:48" (2/3) ... [2024-11-09 01:17:48,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da134df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:17:48, skipping insertion in model container [2024-11-09 01:17:48,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:48" (3/3) ... [2024-11-09 01:17:48,821 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-21.i [2024-11-09 01:17:48,839 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:17:48,839 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:17:48,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:17:48,925 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;@734652fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:17:48,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:17:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 01:17:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 01:17:48,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:48,940 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:17:48,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:48,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:48,947 INFO L85 PathProgramCache]: Analyzing trace with hash -510096507, now seen corresponding path program 1 times [2024-11-09 01:17:48,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:48,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828008695] [2024-11-09 01:17:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:49,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:17:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:49,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:17:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:49,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:17:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:49,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:17:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:49,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 01:17:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:49,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 01:17:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 01:17:49,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:49,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828008695] [2024-11-09 01:17:49,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828008695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:49,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:17:49,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592798880] [2024-11-09 01:17:49,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:49,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:17:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:49,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:17:49,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:17:49,306 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 01:17:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:49,335 INFO L93 Difference]: Finished difference Result 71 states and 111 transitions. [2024-11-09 01:17:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:17:49,338 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-11-09 01:17:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:49,347 INFO L225 Difference]: With dead ends: 71 [2024-11-09 01:17:49,348 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 01:17:49,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-11-09 01:17:49,359 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:49,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:17:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 01:17:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 01:17:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 01:17:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-09 01:17:49,408 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 53 [2024-11-09 01:17:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:49,409 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-09 01:17:49,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 01:17:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-09 01:17:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 01:17:49,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:49,413 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:17:49,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:17:49,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:49,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:49,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1104841853, now seen corresponding path program 1 times [2024-11-09 01:17:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:49,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640569206] [2024-11-09 01:17:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:17:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:17:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:51,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:17:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:17:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 01:17:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:51,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 01:17:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 01:17:51,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640569206] [2024-11-09 01:17:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640569206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:51,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:51,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:17:51,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036281639] [2024-11-09 01:17:51,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:51,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:17:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:51,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:17:51,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:17:51,178 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 01:17:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:51,604 INFO L93 Difference]: Finished difference Result 160 states and 212 transitions. [2024-11-09 01:17:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 01:17:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2024-11-09 01:17:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:51,607 INFO L225 Difference]: With dead ends: 160 [2024-11-09 01:17:51,607 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 01:17:51,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:17:51,609 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 123 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:51,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 315 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:17:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 01:17:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2024-11-09 01:17:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 63 states have internal predecessors, (77), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:17:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2024-11-09 01:17:51,632 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 53 [2024-11-09 01:17:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:51,632 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2024-11-09 01:17:51,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 01:17:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2024-11-09 01:17:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 01:17:51,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:51,634 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:17:51,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:17:51,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:51,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:51,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1443072449, now seen corresponding path program 1 times [2024-11-09 01:17:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:51,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56691759] [2024-11-09 01:17:51,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:51,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:52,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:17:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:52,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:17:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:17:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:52,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:17:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 01:17:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:52,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 01:17:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 01:17:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:52,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56691759] [2024-11-09 01:17:52,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56691759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:52,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:52,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:17:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871471929] [2024-11-09 01:17:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:17:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:17:52,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:17:52,789 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 01:17:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:53,778 INFO L93 Difference]: Finished difference Result 293 states and 386 transitions. [2024-11-09 01:17:53,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:17:53,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2024-11-09 01:17:53,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:53,784 INFO L225 Difference]: With dead ends: 293 [2024-11-09 01:17:53,789 INFO L226 Difference]: Without dead ends: 220 [2024-11-09 01:17:53,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:17:53,797 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 112 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:53,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 337 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:17:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-09 01:17:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 179. [2024-11-09 01:17:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 132 states have (on average 1.2045454545454546) internal successors, (159), 134 states have internal predecessors, (159), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 01:17:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 235 transitions. [2024-11-09 01:17:53,854 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 235 transitions. Word has length 55 [2024-11-09 01:17:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:53,855 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 235 transitions. [2024-11-09 01:17:53,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 01:17:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2024-11-09 01:17:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 01:17:53,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:53,860 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:17:53,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:17:53,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:53,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash 208059101, now seen corresponding path program 1 times [2024-11-09 01:17:53,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:53,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642902877] [2024-11-09 01:17:53,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:53,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:17:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:17:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:17:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:17:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:17:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 01:17:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 01:17:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 01:17:54,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:17:54,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642902877] [2024-11-09 01:17:54,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642902877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:17:54,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:17:54,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:17:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262672895] [2024-11-09 01:17:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:17:54,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:17:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:17:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:17:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:17:54,482 INFO L87 Difference]: Start difference. First operand 179 states and 235 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 01:17:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:54,828 INFO L93 Difference]: Finished difference Result 192 states and 246 transitions. [2024-11-09 01:17:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:17:54,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2024-11-09 01:17:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:54,831 INFO L225 Difference]: With dead ends: 192 [2024-11-09 01:17:54,831 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 01:17:54,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:17:54,833 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 87 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:54,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 231 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:17:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 01:17:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2024-11-09 01:17:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 131 states have internal predecessors, (155), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 01:17:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 231 transitions. [2024-11-09 01:17:54,900 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 231 transitions. Word has length 55 [2024-11-09 01:17:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:54,904 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 231 transitions. [2024-11-09 01:17:54,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 01:17:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 231 transitions. [2024-11-09 01:17:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 01:17:54,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:54,906 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:17:54,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:17:54,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:17:54,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:54,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1551859698, now seen corresponding path program 1 times [2024-11-09 01:17:54,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:17:54,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116049515] [2024-11-09 01:17:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:54,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:17:54,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861019778] [2024-11-09 01:17:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:54,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:17:54,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:17:54,940 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-11-09 01:17:54,941 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-11-09 01:17:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:17:55,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:17:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:17:55,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:17:55,081 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:17:55,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:17:55,112 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-11-09 01:17:55,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:17:55,288 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 01:17:55,337 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:17:55,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:17:55 BoogieIcfgContainer [2024-11-09 01:17:55,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:17:55,341 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:17:55,341 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:17:55,341 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:17:55,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:17:48" (3/4) ... [2024-11-09 01:17:55,344 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:17:55,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:17:55,346 INFO L158 Benchmark]: Toolchain (without parser) took 7411.50ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 95.1MB in the beginning and 173.3MB in the end (delta: -78.2MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-11-09 01:17:55,347 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:17:55,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.78ms. Allocated memory is still 146.8MB. Free memory was 94.6MB in the beginning and 80.6MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 01:17:55,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.52ms. Allocated memory is still 146.8MB. Free memory was 80.6MB in the beginning and 78.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:17:55,348 INFO L158 Benchmark]: Boogie Preprocessor took 66.50ms. Allocated memory is still 146.8MB. Free memory was 78.3MB in the beginning and 75.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:17:55,348 INFO L158 Benchmark]: RCFGBuilder took 427.71ms. Allocated memory is still 146.8MB. Free memory was 75.1MB in the beginning and 60.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:17:55,348 INFO L158 Benchmark]: TraceAbstraction took 6526.58ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 59.6MB in the beginning and 173.3MB in the end (delta: -113.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:17:55,349 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 226.5MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:17:55,350 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.18ms. Allocated memory is still 146.8MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.78ms. Allocated memory is still 146.8MB. Free memory was 94.6MB in the beginning and 80.6MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.52ms. Allocated memory is still 146.8MB. Free memory was 80.6MB in the beginning and 78.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.50ms. Allocated memory is still 146.8MB. Free memory was 78.3MB in the beginning and 75.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 427.71ms. Allocated memory is still 146.8MB. Free memory was 75.1MB in the beginning and 60.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6526.58ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 59.6MB in the beginning and 173.3MB in the end (delta: -113.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 226.5MB. Free memory is still 173.3MB. There was no memory consumed. 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 80, overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_7 = 0; [L24] double var_1_8 = 15.6; [L25] double var_1_9 = 15.4; [L26] double var_1_10 = 32.2; [L27] unsigned char var_1_12 = 1; [L28] signed short int var_1_13 = 256; [L29] float var_1_14 = 5.75; [L30] float var_1_15 = 8.6; [L31] unsigned char last_1_var_1_7 = 0; [L32] signed short int last_1_var_1_13 = 256; VAL [isInitial=0, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_8=78/5, var_1_9=77/5] [L84] isInitial = 1 [L85] FCALL initially() [L86] COND TRUE 1 [L87] CALL updateLastVariables() [L76] last_1_var_1_7 = var_1_7 [L77] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_8=78/5, var_1_9=77/5] [L87] RET updateLastVariables() [L88] CALL updateVariables() [L61] var_1_8 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L62] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L63] var_1_9 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L64] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L65] var_1_10 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L66] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L67] var_1_12 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L68] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L69] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L88] RET updateVariables() [L89] CALL step() [L36] COND TRUE (last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L37] COND FALSE !(last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L45] COND TRUE \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L46] COND TRUE (var_1_14 - var_1_15) >= ((var_1_8 + var_1_10) + var_1_9) [L47] var_1_13 = ((((var_1_1) > (var_1_1)) ? (var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L52] COND TRUE ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) <= var_1_10 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L53] COND FALSE !(last_1_var_1_7 && (var_1_1 >= var_1_1)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L89] RET step() [L90] CALL, EXPR property() [L80-L81] return ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? (var_1_1 == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_13))) && ((((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) <= var_1_10) ? ((last_1_var_1_7 && (var_1_1 >= var_1_1)) ? (var_1_7 == ((unsigned char) 0)) : 1) : (var_1_7 == ((unsigned char) var_1_12)))) && (var_1_12 ? (((var_1_14 - var_1_15) >= ((var_1_8 + var_1_10) + var_1_9)) ? (var_1_13 == ((signed short int) ((((var_1_1) > (var_1_1)) ? (var_1_1) : (var_1_1))))) : (var_1_13 == ((signed short int) var_1_1))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L90] RET, EXPR property() [L90] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 931 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 719 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 446 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 212 mSDtfsCounter, 446 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=3, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 100 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 336/336 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-11-09 01:17:55,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.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 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:17:57,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:17:57,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:17:57,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:17:57,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:17:57,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:17:57,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:17:57,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:17:57,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:17:57,784 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:17:57,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:17:57,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:17:57,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:17:57,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:17:57,788 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:17:57,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:17:57,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:17:57,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:17:57,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:17:57,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:17:57,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:17:57,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:17:57,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:17:57,795 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:17:57,795 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:17:57,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:17:57,796 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:17:57,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:17:57,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:17:57,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:17:57,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:17:57,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:17:57,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:17:57,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:17:57,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:17:57,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:17:57,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:17:57,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:17:57,803 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:17:57,804 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:17:57,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:17:57,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:17:57,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:17:57,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:17:57,805 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 -> 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad [2024-11-09 01:17:58,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:17:58,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:17:58,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:17:58,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:17:58,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:17:58,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i [2024-11-09 01:17:59,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:17:59,939 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:17:59,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i [2024-11-09 01:17:59,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aefb6c94/550a117c7a48406b9aa82c03c0209346/FLAG118d37f3f [2024-11-09 01:18:00,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aefb6c94/550a117c7a48406b9aa82c03c0209346 [2024-11-09 01:18:00,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:18:00,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:18:00,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:18:00,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:18:00,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:18:00,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669f6e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00, skipping insertion in model container [2024-11-09 01:18:00,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:18:00,524 WARN L250 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_variablewrapping_normal_file-21.i[913,926] [2024-11-09 01:18:00,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:18:00,592 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:18:00,606 WARN L250 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_variablewrapping_normal_file-21.i[913,926] [2024-11-09 01:18:00,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:18:00,660 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:18:00,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00 WrapperNode [2024-11-09 01:18:00,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:18:00,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:18:00,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:18:00,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:18:00,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,711 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-09 01:18:00,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:18:00,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:18:00,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:18:00,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:18:00,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,750 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-11-09 01:18:00,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:18:00,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:18:00,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:18:00,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:18:00,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (1/1) ... [2024-11-09 01:18:00,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:18:00,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:18:00,824 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-11-09 01:18:00,827 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-11-09 01:18:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:18:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:18:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:18:00,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:18:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:18:00,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:18:00,971 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:18:00,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:18:07,365 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 01:18:07,365 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:18:07,376 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:18:07,377 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:18:07,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:07 BoogieIcfgContainer [2024-11-09 01:18:07,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:18:07,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:18:07,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:18:07,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:18:07,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:18:00" (1/3) ... [2024-11-09 01:18:07,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd8d049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:18:07, skipping insertion in model container [2024-11-09 01:18:07,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:18:00" (2/3) ... [2024-11-09 01:18:07,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd8d049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:18:07, skipping insertion in model container [2024-11-09 01:18:07,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:18:07" (3/3) ... [2024-11-09 01:18:07,387 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-21.i [2024-11-09 01:18:07,403 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:18:07,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:18:07,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:18:07,472 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;@5349007d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:18:07,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:18:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 01:18:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 01:18:07,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:07,489 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:18:07,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:07,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash -510096507, now seen corresponding path program 1 times [2024-11-09 01:18:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:18:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464036196] [2024-11-09 01:18:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:07,517 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-11-09 01:18:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:18:07,521 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-11-09 01:18:07,523 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-11-09 01:18:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:07,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:18:07,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:18:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 01:18:07,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:18:07,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:18:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464036196] [2024-11-09 01:18:07,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464036196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:07,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:18:07,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:18:07,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000708006] [2024-11-09 01:18:07,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:18:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:18:07,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:18:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:18:07,794 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 01:18:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:07,829 INFO L93 Difference]: Finished difference Result 71 states and 111 transitions. [2024-11-09 01:18:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:18:07,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-11-09 01:18:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:07,842 INFO L225 Difference]: With dead ends: 71 [2024-11-09 01:18:07,843 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 01:18:07,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 52 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-11-09 01:18:07,852 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:07,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:18:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 01:18:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 01:18:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 01:18:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-09 01:18:07,905 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 53 [2024-11-09 01:18:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:07,906 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-09 01:18:07,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 01:18:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-09 01:18:07,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 01:18:07,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:07,910 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:18:07,919 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-11-09 01:18:08,112 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-11-09 01:18:08,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:08,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:08,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1104841853, now seen corresponding path program 1 times [2024-11-09 01:18:08,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:18:08,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236544083] [2024-11-09 01:18:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:08,124 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-11-09 01:18:08,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:18:08,126 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-11-09 01:18:08,131 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-11-09 01:18:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:08,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:18:08,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:18:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 01:18:08,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:18:08,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:18:08,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236544083] [2024-11-09 01:18:08,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236544083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:18:08,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:18:08,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:18:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49091994] [2024-11-09 01:18:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:18:08,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:18:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:18:08,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:18:08,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:18:08,792 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 01:18:12,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:18:16,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:18:18,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:18:22,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:18:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:22,058 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2024-11-09 01:18:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:18:22,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2024-11-09 01:18:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:22,084 INFO L225 Difference]: With dead ends: 107 [2024-11-09 01:18:22,084 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 01:18:22,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:18:22,086 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 53 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:22,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 122 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2024-11-09 01:18:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 01:18:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2024-11-09 01:18:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:18:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2024-11-09 01:18:22,102 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 53 [2024-11-09 01:18:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:22,103 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2024-11-09 01:18:22,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 01:18:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-11-09 01:18:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 01:18:22,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:22,105 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:18:22,114 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-09 01:18:22,305 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-11-09 01:18:22,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:22,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:22,307 INFO L85 PathProgramCache]: Analyzing trace with hash 706987382, now seen corresponding path program 1 times [2024-11-09 01:18:22,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:18:22,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486513186] [2024-11-09 01:18:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:22,308 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-11-09 01:18:22,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:18:22,311 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-11-09 01:18:22,312 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-11-09 01:18:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:22,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:18:22,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:18:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 01:18:22,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:18:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 01:18:23,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:18:23,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486513186] [2024-11-09 01:18:23,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486513186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:18:23,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:18:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-09 01:18:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637431578] [2024-11-09 01:18:23,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:18:23,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:18:23,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:18:23,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:18:23,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:18:23,063 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:18:26,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 01:18:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:18:26,486 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2024-11-09 01:18:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:18:26,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 54 [2024-11-09 01:18:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:18:26,513 INFO L225 Difference]: With dead ends: 125 [2024-11-09 01:18:26,513 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 01:18:26,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:18:26,514 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:18:26,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 93 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 01:18:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 01:18:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-11-09 01:18:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:18:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2024-11-09 01:18:26,529 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 54 [2024-11-09 01:18:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:18:26,529 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2024-11-09 01:18:26,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:18:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2024-11-09 01:18:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 01:18:26,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:18:26,532 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:18:26,539 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-09 01:18:26,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-11-09 01:18:26,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:18:26,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:18:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1443072449, now seen corresponding path program 1 times [2024-11-09 01:18:26,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:18:26,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977654479] [2024-11-09 01:18:26,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:18:26,734 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-11-09 01:18:26,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:18:26,738 INFO L229 MonitoredProcess]: Starting monitored process 5 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-11-09 01:18:26,739 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 (5)] Waiting until timeout for monitored process [2024-11-09 01:18:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:18:26,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:18:26,988 INFO L278 TraceCheckSpWp]: Computing forward predicates...