./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_wrapper-s_file-0.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 673f48eff2c9fa553be4e6ec558f63c53157e8de398373430e9065fe538627b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:02:59,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:02:59,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:02:59,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:02:59,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:02:59,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:02:59,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:02:59,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:02:59,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:02:59,324 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:02:59,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:02:59,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:02:59,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:02:59,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:02:59,327 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:02:59,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:02:59,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:02:59,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:02:59,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:02:59,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:02:59,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:02:59,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:02:59,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:02:59,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:02:59,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:02:59,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:02:59,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:02:59,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:02:59,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:02:59,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:02:59,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:02:59,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:02:59,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:02:59,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:02:59,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:02:59,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:02:59,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:02:59,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:02:59,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:02:59,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:02:59,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:02:59,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:02:59,336 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 -> 673f48eff2c9fa553be4e6ec558f63c53157e8de398373430e9065fe538627b8 [2024-11-19 01:02:59,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:02:59,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:02:59,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:02:59,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:02:59,579 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:02:59,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2024-11-19 01:03:00,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:03:01,064 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:03:01,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2024-11-19 01:03:01,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84dd20dec/76238d5279cc4b0b802e683b7fff2b89/FLAGe5da59e73 [2024-11-19 01:03:01,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84dd20dec/76238d5279cc4b0b802e683b7fff2b89 [2024-11-19 01:03:01,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:03:01,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:03:01,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:03:01,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:03:01,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:03:01,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db4f248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01, skipping insertion in model container [2024-11-19 01:03:01,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:03:01,668 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_wrapper-s_file-0.i[915,928] [2024-11-19 01:03:01,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:03:01,711 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:03:01,720 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_wrapper-s_file-0.i[915,928] [2024-11-19 01:03:01,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:03:01,762 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:03:01,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01 WrapperNode [2024-11-19 01:03:01,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:03:01,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:03:01,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:03:01,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:03:01,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,811 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 359 [2024-11-19 01:03:01,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:03:01,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:03:01,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:03:01,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:03:01,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,855 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-19 01:03:01,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:03:01,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:03:01,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:03:01,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:03:01,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (1/1) ... [2024-11-19 01:03:01,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:03:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:03:01,916 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-19 01:03:01,919 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-19 01:03:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:03:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:03:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:03:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 01:03:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 01:03:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 01:03:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 01:03:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:03:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:03:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:03:01,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:03:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:03:02,071 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:03:02,073 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:03:02,473 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-19 01:03:02,473 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:03:02,491 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:03:02,492 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:03:02,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:03:02 BoogieIcfgContainer [2024-11-19 01:03:02,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:03:02,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:03:02,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:03:02,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:03:02,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:03:01" (1/3) ... [2024-11-19 01:03:02,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1ee70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:03:02, skipping insertion in model container [2024-11-19 01:03:02,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:01" (2/3) ... [2024-11-19 01:03:02,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1ee70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:03:02, skipping insertion in model container [2024-11-19 01:03:02,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:03:02" (3/3) ... [2024-11-19 01:03:02,502 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-0.i [2024-11-19 01:03:02,516 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:03:02,516 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:03:02,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:03:02,577 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;@6378cb55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:03:02,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:03:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:03:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:03:02,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:02,590 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:02,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:02,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1487137030, now seen corresponding path program 1 times [2024-11-19 01:03:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:03:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037566477] [2024-11-19 01:03:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:02,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:03:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-19 01:03:02,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:03:02,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037566477] [2024-11-19 01:03:02,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037566477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:03:02,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064800946] [2024-11-19 01:03:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:02,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:03:02,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:03:02,846 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-19 01:03:02,853 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-19 01:03:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:02,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:03:02,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-19 01:03:03,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:03:03,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064800946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:03,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:03:03,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:03:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281089014] [2024-11-19 01:03:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:03,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:03:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:03:03,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:03:03,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:03:03,066 INFO L87 Difference]: Start difference. First operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:03:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:03,114 INFO L93 Difference]: Finished difference Result 160 states and 245 transitions. [2024-11-19 01:03:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:03:03,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 01:03:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:03,121 INFO L225 Difference]: With dead ends: 160 [2024-11-19 01:03:03,121 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 01:03:03,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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-19 01:03:03,126 INFO L432 NwaCegarLoop]: 108 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, 108 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-19 01:03:03,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:03:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 01:03:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 01:03:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:03:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-19 01:03:03,170 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 78 [2024-11-19 01:03:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:03,170 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-19 01:03:03,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:03:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-11-19 01:03:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:03:03,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:03,173 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:03,188 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-19 01:03:03,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:03:03,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:03,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1976566482, now seen corresponding path program 1 times [2024-11-19 01:03:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:03:03,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81105615] [2024-11-19 01:03:03,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:03:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:03:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:03:03,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81105615] [2024-11-19 01:03:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81105615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:03,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:03:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:03:03,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467319652] [2024-11-19 01:03:03,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:03:03,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:03:03,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:03:03,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:03:03,532 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:03:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:03,560 INFO L93 Difference]: Finished difference Result 155 states and 216 transitions. [2024-11-19 01:03:03,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:03:03,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 01:03:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:03,562 INFO L225 Difference]: With dead ends: 155 [2024-11-19 01:03:03,563 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 01:03:03,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:03:03,565 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:03,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:03:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 01:03:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 01:03:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:03:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2024-11-19 01:03:03,578 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 78 [2024-11-19 01:03:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:03,579 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2024-11-19 01:03:03,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:03:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-11-19 01:03:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:03:03,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:03,582 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:03,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:03:03,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:03,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:03,582 INFO L85 PathProgramCache]: Analyzing trace with hash 14991824, now seen corresponding path program 1 times [2024-11-19 01:03:03,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:03:03,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041726895] [2024-11-19 01:03:03,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:03,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:03:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:03:03,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:03:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:03:03,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:03:03,726 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:03:03,727 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:03:03,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:03:03,731 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 01:03:03,769 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:03:03,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:03:03 BoogieIcfgContainer [2024-11-19 01:03:03,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:03:03,774 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:03:03,774 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:03:03,774 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:03:03,775 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:03:02" (3/4) ... [2024-11-19 01:03:03,777 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:03:03,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:03:03,779 INFO L158 Benchmark]: Toolchain (without parser) took 2326.16ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 62.9MB in the beginning and 100.7MB in the end (delta: -37.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-19 01:03:03,779 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:03:03,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.11ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 62.7MB in the beginning and 149.4MB in the end (delta: -86.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-19 01:03:03,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.54ms. Allocated memory is still 186.6MB. Free memory was 149.4MB in the beginning and 145.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:03:03,780 INFO L158 Benchmark]: Boogie Preprocessor took 68.48ms. Allocated memory is still 186.6MB. Free memory was 145.2MB in the beginning and 142.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:03:03,780 INFO L158 Benchmark]: RCFGBuilder took 611.29ms. Allocated memory is still 186.6MB. Free memory was 142.1MB in the beginning and 115.9MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 01:03:03,780 INFO L158 Benchmark]: TraceAbstraction took 1279.55ms. Allocated memory is still 186.6MB. Free memory was 114.8MB in the beginning and 100.7MB in the end (delta: 14.1MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-19 01:03:03,781 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 186.6MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:03:03,782 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.17ms. Allocated memory is still 134.2MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.11ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 62.7MB in the beginning and 149.4MB in the end (delta: -86.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.54ms. Allocated memory is still 186.6MB. Free memory was 149.4MB in the beginning and 145.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.48ms. Allocated memory is still 186.6MB. Free memory was 145.2MB in the beginning and 142.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.29ms. Allocated memory is still 186.6MB. Free memory was 142.1MB in the beginning and 115.9MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1279.55ms. Allocated memory is still 186.6MB. Free memory was 114.8MB in the beginning and 100.7MB in the end (delta: 14.1MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 186.6MB. Free memory is still 100.7MB. 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 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 62. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L45] double last_1_WrapperStruct0_var_1_5 = 5.25; [L46] unsigned char last_1_WrapperStruct0_var_1_10 = 100; [L47] unsigned short int last_1_WrapperStruct0_var_1_13 = 5; VAL [WrapperStruct0={4:0}, isInitial=0, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L98] EXPR WrapperStruct0.var_1_5 [L98] last_1_WrapperStruct0_var_1_5 = WrapperStruct0.var_1_5 [L99] EXPR WrapperStruct0.var_1_10 [L99] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L100] EXPR WrapperStruct0.var_1_13 [L100] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L83] WrapperStruct0.var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L84] CALL assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L84] RET assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L85] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L85] CALL assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L85] RET assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L86] WrapperStruct0.var_1_3 = __VERIFIER_nondet_double() [L87] EXPR WrapperStruct0.var_1_3 [L87] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F [L87] EXPR WrapperStruct0.var_1_3 [L87] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] CALL assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L87] RET assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L88] WrapperStruct0.var_1_4 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct0.var_1_4 [L89] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F [L89] EXPR WrapperStruct0.var_1_4 [L89] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] CALL assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L89] RET assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L90] WrapperStruct0.var_1_9 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L92] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L111] RET updateVariables() [L112] CALL step() [L51] WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L51] COND FALSE !(WrapperStruct0.var_1_9) [L56] COND FALSE !((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L61] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L61] COND TRUE ! WrapperStruct0.var_1_2 [L62] EXPR WrapperStruct0.var_1_3 [L62] EXPR WrapperStruct0.var_1_4 [L62] WrapperStruct0.var_1_1 = (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4) [L66] EXPR WrapperStruct0.var_1_3 [L66] EXPR WrapperStruct0.var_1_4 [L66] EXPR WrapperStruct0.var_1_1 [L66] EXPR WrapperStruct0.var_1_1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L66] COND FALSE !((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) [L79] EXPR WrapperStruct0.var_1_3 [L79] WrapperStruct0.var_1_5 = WrapperStruct0.var_1_3 [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR (! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3))))) [L103] EXPR WrapperStruct0.var_1_1 [L103] EXPR WrapperStruct0.var_1_3 [L103] EXPR WrapperStruct0.var_1_4 [L103] EXPR (! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3))))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR (((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR (((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1)) && (WrapperStruct0.var_1_9 ? (((WrapperStruct0.var_1_4 * (WrapperStruct0.var_1_3 - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? (WrapperStruct0.var_1_13 == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] EXPR ((((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1)) && (WrapperStruct0.var_1_9 ? (((WrapperStruct0.var_1_4 * (WrapperStruct0.var_1_3 - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? (WrapperStruct0.var_1_13 == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103-L104] return ((((! WrapperStruct0.var_1_2) ? (WrapperStruct0.var_1_1 == ((double) (WrapperStruct0.var_1_3 - WrapperStruct0.var_1_4))) : (WrapperStruct0.var_1_1 == ((double) ((((16.2) < (WrapperStruct0.var_1_3)) ? (16.2) : (WrapperStruct0.var_1_3)))))) && (((WrapperStruct0.var_1_3 + (WrapperStruct0.var_1_4 + WrapperStruct0.var_1_1)) != WrapperStruct0.var_1_1) ? (WrapperStruct0.var_1_2 ? (((- WrapperStruct0.var_1_13) <= WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_9 ? (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_4)) : 1) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_5 == ((double) WrapperStruct0.var_1_3)))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? (WrapperStruct0.var_1_10 == ((unsigned char) WrapperStruct0.var_1_12)) : 1) : 1)) && (WrapperStruct0.var_1_9 ? (((WrapperStruct0.var_1_4 * (WrapperStruct0.var_1_3 - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? (WrapperStruct0.var_1_13 == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L19] reach_error() VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 214 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 322/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-19 01:03:03,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_wrapper-s_file-0.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 673f48eff2c9fa553be4e6ec558f63c53157e8de398373430e9065fe538627b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:03:05,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:03:05,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:03:05,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:03:05,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:03:05,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:03:05,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:03:05,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:03:05,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:03:05,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:03:05,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:03:05,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:03:05,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:03:05,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:03:05,832 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:03:05,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:03:05,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:03:05,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:03:05,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:03:05,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:03:05,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:03:05,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:03:05,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:03:05,838 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:03:05,838 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:03:05,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:03:05,838 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:03:05,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:03:05,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:03:05,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:03:05,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:03:05,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:03:05,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:03:05,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:03:05,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:03:05,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:03:05,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:03:05,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:03:05,840 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:03:05,840 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:03:05,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:03:05,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:03:05,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:03:05,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:03:05,843 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 -> 673f48eff2c9fa553be4e6ec558f63c53157e8de398373430e9065fe538627b8 [2024-11-19 01:03:06,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:03:06,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:03:06,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:03:06,128 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:03:06,129 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:03:06,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2024-11-19 01:03:07,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:03:07,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:03:07,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-0.i [2024-11-19 01:03:07,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713509ac0/b382a2ce4aca46f0b2aa93ddc03c8128/FLAGa462e8a54 [2024-11-19 01:03:08,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713509ac0/b382a2ce4aca46f0b2aa93ddc03c8128 [2024-11-19 01:03:08,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:03:08,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:03:08,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:03:08,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:03:08,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:03:08,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ebe818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08, skipping insertion in model container [2024-11-19 01:03:08,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:03:08,203 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_wrapper-s_file-0.i[915,928] [2024-11-19 01:03:08,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:03:08,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:03:08,286 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_wrapper-s_file-0.i[915,928] [2024-11-19 01:03:08,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:03:08,345 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:03:08,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08 WrapperNode [2024-11-19 01:03:08,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:03:08,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:03:08,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:03:08,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:03:08,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,404 INFO L138 Inliner]: procedures = 33, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 359 [2024-11-19 01:03:08,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:03:08,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:03:08,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:03:08,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:03:08,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,467 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-19 01:03:08,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:03:08,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:03:08,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:03:08,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:03:08,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (1/1) ... [2024-11-19 01:03:08,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:03:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:03:08,551 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-19 01:03:08,562 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-19 01:03:08,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:03:08,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:03:08,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:03:08,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:03:08,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:03:08,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:03:08,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:03:08,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 01:03:08,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 01:03:08,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:03:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:03:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 01:03:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 01:03:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:03:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:03:08,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:03:08,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:03:08,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:03:08,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:03:08,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:03:08,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:03:08,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:03:08,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:03:08,710 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:03:08,713 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:03:24,068 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-19 01:03:24,068 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:03:24,085 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:03:24,085 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:03:24,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:03:24 BoogieIcfgContainer [2024-11-19 01:03:24,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:03:24,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:03:24,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:03:24,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:03:24,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:03:08" (1/3) ... [2024-11-19 01:03:24,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b1a590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:03:24, skipping insertion in model container [2024-11-19 01:03:24,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:03:08" (2/3) ... [2024-11-19 01:03:24,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b1a590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:03:24, skipping insertion in model container [2024-11-19 01:03:24,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:03:24" (3/3) ... [2024-11-19 01:03:24,092 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-0.i [2024-11-19 01:03:24,106 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:03:24,106 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:03:24,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:03:24,173 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;@529e7bb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:03:24,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:03:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:03:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:03:24,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:24,185 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:24,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:24,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1487137030, now seen corresponding path program 1 times [2024-11-19 01:03:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:24,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534957775] [2024-11-19 01:03:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:24,204 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-19 01:03:24,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:24,209 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-19 01:03:24,210 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-19 01:03:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:24,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:03:24,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-19 01:03:24,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:03:24,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:24,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534957775] [2024-11-19 01:03:24,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534957775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:03:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:03:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757694689] [2024-11-19 01:03:24,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:24,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:03:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:24,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:03:24,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:03:24,684 INFO L87 Difference]: Start difference. First operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:03:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:24,702 INFO L93 Difference]: Finished difference Result 160 states and 245 transitions. [2024-11-19 01:03:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:03:24,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 01:03:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:24,713 INFO L225 Difference]: With dead ends: 160 [2024-11-19 01:03:24,713 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 01:03:24,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-19 01:03:24,718 INFO L432 NwaCegarLoop]: 108 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, 108 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-19 01:03:24,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:03:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 01:03:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 01:03:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:03:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-19 01:03:24,754 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 78 [2024-11-19 01:03:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:24,755 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-19 01:03:24,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:03:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-11-19 01:03:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:03:24,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:24,758 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:24,776 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-19 01:03:24,958 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-19 01:03:24,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:24,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1976566482, now seen corresponding path program 1 times [2024-11-19 01:03:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598552300] [2024-11-19 01:03:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:24,961 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-19 01:03:24,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:24,967 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-19 01:03:24,968 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-19 01:03:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:25,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:03:25,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 01:03:25,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:03:25,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598552300] [2024-11-19 01:03:25,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598552300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:25,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:03:25,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:03:25,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480897783] [2024-11-19 01:03:25,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:25,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:03:25,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:25,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:03:25,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:03:25,495 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:03:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:25,623 INFO L93 Difference]: Finished difference Result 155 states and 216 transitions. [2024-11-19 01:03:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:03:25,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 01:03:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:25,624 INFO L225 Difference]: With dead ends: 155 [2024-11-19 01:03:25,624 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 01:03:25,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:03:25,626 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:25,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:03:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 01:03:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 01:03:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:03:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2024-11-19 01:03:25,633 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 78 [2024-11-19 01:03:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:25,635 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2024-11-19 01:03:25,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:03:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-11-19 01:03:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:03:25,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:25,637 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:25,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 01:03:25,841 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-19 01:03:25,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:25,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:25,842 INFO L85 PathProgramCache]: Analyzing trace with hash 14991824, now seen corresponding path program 1 times [2024-11-19 01:03:25,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:25,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823062157] [2024-11-19 01:03:25,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:25,843 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-19 01:03:25,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:25,846 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-19 01:03:25,847 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-19 01:03:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:26,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:03:26,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:03:26,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:03:26,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-19 01:03:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 01:03:26,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:03:26,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:03:26,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823062157] [2024-11-19 01:03:26,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823062157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:03:26,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:03:26,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:03:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202778795] [2024-11-19 01:03:26,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:03:26,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:03:26,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:03:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:03:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:03:26,702 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:03:30,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:03:35,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:03:39,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:03:43,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:03:47,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:03:53,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:03:57,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:03:59,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:03:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:03:59,250 INFO L93 Difference]: Finished difference Result 157 states and 217 transitions. [2024-11-19 01:03:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:03:59,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 01:03:59,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:03:59,283 INFO L225 Difference]: With dead ends: 157 [2024-11-19 01:03:59,283 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 01:03:59,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:03:59,285 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 94 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:03:59,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 284 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 5 Unknown, 0 Unchecked, 32.4s Time] [2024-11-19 01:03:59,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 01:03:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-11-19 01:03:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:03:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2024-11-19 01:03:59,292 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 78 [2024-11-19 01:03:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:03:59,292 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-11-19 01:03:59,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:03:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2024-11-19 01:03:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 01:03:59,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:03:59,294 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:03:59,312 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 (4)] Ended with exit code 0 [2024-11-19 01:03:59,495 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-19 01:03:59,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:03:59,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:03:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash 196972952, now seen corresponding path program 1 times [2024-11-19 01:03:59,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:03:59,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111818767] [2024-11-19 01:03:59,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:03:59,496 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-19 01:03:59,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:03:59,498 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-19 01:03:59,498 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-19 01:03:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:03:59,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:03:59,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:04:00,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:04:00,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2024-11-19 01:04:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 01:04:00,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:04:01,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:04:01,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2024-11-19 01:04:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-19 01:04:01,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:04:01,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111818767] [2024-11-19 01:04:01,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111818767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:04:01,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:04:01,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-19 01:04:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089477254] [2024-11-19 01:04:01,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:04:01,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:04:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:04:01,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:04:01,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:04:01,320 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 01:04:06,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:04:10,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:04:14,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:04:19,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:04:23,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:04:27,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:04:28,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:04:32,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:04:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:04:33,223 INFO L93 Difference]: Finished difference Result 166 states and 226 transitions. [2024-11-19 01:04:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 01:04:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 80 [2024-11-19 01:04:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:04:33,256 INFO L225 Difference]: With dead ends: 166 [2024-11-19 01:04:33,256 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 01:04:33,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-19 01:04:33,257 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 103 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:04:33,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 398 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 362 Invalid, 4 Unknown, 0 Unchecked, 31.2s Time] [2024-11-19 01:04:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 01:04:33,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-11-19 01:04:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:04:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 105 transitions. [2024-11-19 01:04:33,263 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 105 transitions. Word has length 80 [2024-11-19 01:04:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:04:33,264 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 105 transitions. [2024-11-19 01:04:33,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 01:04:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 105 transitions. [2024-11-19 01:04:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 01:04:33,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:04:33,267 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:04:33,284 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 (5)] Ended with exit code 0 [2024-11-19 01:04:33,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-19 01:04:33,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:04:33,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:04:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash 614369558, now seen corresponding path program 1 times [2024-11-19 01:04:33,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:04:33,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169109479] [2024-11-19 01:04:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:04:33,469 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-19 01:04:33,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:04:33,472 INFO L229 MonitoredProcess]: Starting monitored process 6 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-19 01:04:33,473 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 (6)] Waiting until timeout for monitored process [2024-11-19 01:04:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:04:33,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:04:33,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:04:34,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:04:34,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-19 01:04:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-19 01:04:34,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:04:34,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:04:34,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169109479] [2024-11-19 01:04:34,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169109479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:04:34,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:04:34,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:04:34,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596413519] [2024-11-19 01:04:34,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:04:34,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:04:34,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:04:34,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:04:34,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:04:34,297 INFO L87 Difference]: Start difference. First operand 78 states and 105 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:04:38,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:04:42,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []