./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -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 f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 19:25:12,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 19:25:12,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 19:25:12,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 19:25:12,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 19:25:12,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 19:25:12,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 19:25:12,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 19:25:12,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 19:25:12,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 19:25:12,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 19:25:12,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 19:25:12,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 19:25:12,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 19:25:12,427 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 19:25:12,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 19:25:12,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 19:25:12,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 19:25:12,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 19:25:12,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 19:25:12,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 19:25:12,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 19:25:12,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 19:25:12,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 19:25:12,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 19:25:12,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 19:25:12,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 19:25:12,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 19:25:12,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 19:25:12,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 19:25:12,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 19:25:12,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 19:25:12,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:25:12,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 19:25:12,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 19:25:12,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 19:25:12,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 19:25:12,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 19:25:12,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 19:25:12,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 19:25:12,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 19:25:12,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 19:25:12,434 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 -> f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 [2024-11-19 19:25:12,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 19:25:12,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 19:25:12,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 19:25:12,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 19:25:12,627 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 19:25:12,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-19 19:25:13,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 19:25:14,013 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 19:25:14,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-19 19:25:14,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b7214d6/cd3e20df994844b0b2ae92948fa85145/FLAG7be9346e2 [2024-11-19 19:25:14,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b7214d6/cd3e20df994844b0b2ae92948fa85145 [2024-11-19 19:25:14,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 19:25:14,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 19:25:14,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 19:25:14,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 19:25:14,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 19:25:14,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b831670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14, skipping insertion in model container [2024-11-19 19:25:14,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 19:25:14,239 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/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-19 19:25:14,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:25:14,252 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 19:25:14,275 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/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-19 19:25:14,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:25:14,293 INFO L204 MainTranslator]: Completed translation [2024-11-19 19:25:14,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14 WrapperNode [2024-11-19 19:25:14,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 19:25:14,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 19:25:14,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 19:25:14,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 19:25:14,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,325 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-19 19:25:14,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 19:25:14,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 19:25:14,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 19:25:14,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 19:25:14,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,386 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-19 19:25:14,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,397 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 19:25:14,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 19:25:14,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 19:25:14,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 19:25:14,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (1/1) ... [2024-11-19 19:25:14,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:25:14,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 19:25:14,430 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 19:25:14,433 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 19:25:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 19:25:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 19:25:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 19:25:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 19:25:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 19:25:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-19 19:25:14,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-19 19:25:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 19:25:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 19:25:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 19:25:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 19:25:14,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 19:25:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 19:25:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 19:25:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 19:25:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 19:25:14,514 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 19:25:14,515 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 19:25:14,672 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-19 19:25:14,673 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 19:25:14,683 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 19:25:14,683 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 19:25:14,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:14 BoogieIcfgContainer [2024-11-19 19:25:14,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 19:25:14,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 19:25:14,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 19:25:14,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 19:25:14,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:25:14" (1/3) ... [2024-11-19 19:25:14,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132a94d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:14, skipping insertion in model container [2024-11-19 19:25:14,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:14" (2/3) ... [2024-11-19 19:25:14,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132a94d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:14, skipping insertion in model container [2024-11-19 19:25:14,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:14" (3/3) ... [2024-11-19 19:25:14,693 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2024-11-19 19:25:14,705 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 19:25:14,705 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 19:25:14,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 19:25:14,750 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;@7d725b11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 19:25:14,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 19:25:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:25:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 19:25:14,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:14,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:14,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-19 19:25:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:14,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896944925] [2024-11-19 19:25:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:14,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:25:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:14,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:25:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896944925] [2024-11-19 19:25:14,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896944925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:14,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:14,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 19:25:14,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358169217] [2024-11-19 19:25:14,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:14,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 19:25:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:25:14,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 19:25:14,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 19:25:14,947 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:14,985 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-19 19:25:14,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 19:25:14,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 19:25:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:14,994 INFO L225 Difference]: With dead ends: 55 [2024-11-19 19:25:14,994 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 19:25:14,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 19:25:15,000 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:15,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 19:25:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-19 19:25:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:25:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-19 19:25:15,031 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-19 19:25:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:15,032 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-19 19:25:15,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-19 19:25:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 19:25:15,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:15,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:15,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 19:25:15,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:15,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:15,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-19 19:25:15,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:15,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736810730] [2024-11-19 19:25:15,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:15,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:15,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:25:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:15,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:25:15,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736810730] [2024-11-19 19:25:15,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736810730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:15,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:15,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:25:15,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462159204] [2024-11-19 19:25:15,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:15,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:25:15,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:25:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:25:15,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:15,266 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:15,297 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-19 19:25:15,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:25:15,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 19:25:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:15,300 INFO L225 Difference]: With dead ends: 39 [2024-11-19 19:25:15,300 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 19:25:15,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:15,302 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:15,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 19:25:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-19 19:25:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:25:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-19 19:25:15,313 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-19 19:25:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:15,313 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-19 19:25:15,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-19 19:25:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:25:15,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:15,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:15,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 19:25:15,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:15,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-19 19:25:15,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:15,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258288572] [2024-11-19 19:25:15,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:15,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:15,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:25:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:15,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:25:15,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258288572] [2024-11-19 19:25:15,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258288572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:15,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:15,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:25:15,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132824439] [2024-11-19 19:25:15,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:15,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:25:15,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:25:15,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:25:15,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:15,442 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:15,480 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-19 19:25:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:25:15,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 19:25:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:15,481 INFO L225 Difference]: With dead ends: 43 [2024-11-19 19:25:15,481 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 19:25:15,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:15,483 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:15,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 19:25:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-19 19:25:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:25:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-19 19:25:15,493 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-19 19:25:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:15,493 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-19 19:25:15,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-19 19:25:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:25:15,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:15,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:15,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 19:25:15,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:15,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:15,496 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-19 19:25:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:15,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300326154] [2024-11-19 19:25:15,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:15,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:15,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:25:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:15,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:25:15,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300326154] [2024-11-19 19:25:15,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300326154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:15,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:15,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:25:15,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537001432] [2024-11-19 19:25:15,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:15,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:25:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:25:15,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:25:15,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:15,598 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:15,624 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-19 19:25:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:25:15,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 19:25:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:15,625 INFO L225 Difference]: With dead ends: 43 [2024-11-19 19:25:15,626 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 19:25:15,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:15,627 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:15,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 19:25:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-19 19:25:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:25:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-19 19:25:15,631 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-19 19:25:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:15,631 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-19 19:25:15,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-19 19:25:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 19:25:15,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:15,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:15,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 19:25:15,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:15,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-19 19:25:15,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:15,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346539209] [2024-11-19 19:25:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:15,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 19:25:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:25:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346539209] [2024-11-19 19:25:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346539209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:15,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:15,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:25:15,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120678274] [2024-11-19 19:25:15,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:15,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:25:15,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:25:15,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:25:15,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:15,705 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:15,727 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-19 19:25:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:25:15,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-19 19:25:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:15,728 INFO L225 Difference]: With dead ends: 43 [2024-11-19 19:25:15,729 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 19:25:15,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:15,729 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:15,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 19:25:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-19 19:25:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:25:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-19 19:25:15,737 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-19 19:25:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:15,737 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-19 19:25:15,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-19 19:25:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 19:25:15,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:15,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:15,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 19:25:15,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:15,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-19 19:25:15,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:25:15,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228230912] [2024-11-19 19:25:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:25:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 19:25:15,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 19:25:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 19:25:15,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 19:25:15,771 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 19:25:15,772 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 19:25:15,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 19:25:15,776 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 19:25:15,790 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 19:25:15,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:25:15 BoogieIcfgContainer [2024-11-19 19:25:15,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 19:25:15,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 19:25:15,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 19:25:15,793 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 19:25:15,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:14" (3/4) ... [2024-11-19 19:25:15,794 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 19:25:15,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 19:25:15,795 INFO L158 Benchmark]: Toolchain (without parser) took 1754.43ms. Allocated memory is still 174.1MB. Free memory was 104.9MB in the beginning and 92.9MB in the end (delta: 12.1MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-11-19 19:25:15,795 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:25:15,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.95ms. Allocated memory is still 174.1MB. Free memory was 104.7MB in the beginning and 91.5MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 19:25:15,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.36ms. Allocated memory is still 174.1MB. Free memory was 91.5MB in the beginning and 89.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:25:15,796 INFO L158 Benchmark]: Boogie Preprocessor took 77.11ms. Allocated memory is still 174.1MB. Free memory was 89.9MB in the beginning and 143.8MB in the end (delta: -53.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 19:25:15,796 INFO L158 Benchmark]: RCFGBuilder took 281.14ms. Allocated memory is still 174.1MB. Free memory was 143.8MB in the beginning and 129.0MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 19:25:15,796 INFO L158 Benchmark]: TraceAbstraction took 1106.25ms. Allocated memory is still 174.1MB. Free memory was 128.3MB in the beginning and 92.9MB in the end (delta: 35.5MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-11-19 19:25:15,796 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 174.1MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:25:15,797 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.95ms. Allocated memory is still 174.1MB. Free memory was 104.7MB in the beginning and 91.5MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.36ms. Allocated memory is still 174.1MB. Free memory was 91.5MB in the beginning and 89.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.11ms. Allocated memory is still 174.1MB. Free memory was 89.9MB in the beginning and 143.8MB in the end (delta: -53.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 281.14ms. Allocated memory is still 174.1MB. Free memory was 143.8MB in the beginning and 129.0MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1106.25ms. Allocated memory is still 174.1MB. Free memory was 128.3MB in the beginning and 92.9MB in the end (delta: 35.5MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 174.1MB. Free memory is still 92.9MB. 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: 82]: 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 81, overapproximation of someUnaryDOUBLEoperation at line 77. Possible FailurePath: [L76] double x = 0.0; [L77] double y = -0.0; [L78] CALL, EXPR fmin_double(x, y) [L48] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L30-L31] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L33-L34] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L36-L37] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L40-L41] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L44] return 0; VAL [\old(x)=0, \result=0, x=0] [L48] RET, EXPR __fpclassify_double(x) VAL [x=0, y=4294967306] [L48] COND TRUE __fpclassify_double(x) == 0 [L49] return y; VAL [\result=4294967306, x=0] [L78] RET, EXPR fmin_double(x, y) [L78] double res = fmin_double(x, y); [L81] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=4294967306] [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L82] reach_error() VAL [res=4294967306] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 170 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 19:25:15,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -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 f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 19:25:17,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 19:25:17,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 19:25:17,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 19:25:17,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 19:25:17,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 19:25:17,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 19:25:17,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 19:25:17,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 19:25:17,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 19:25:17,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 19:25:17,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 19:25:17,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 19:25:17,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 19:25:17,637 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 19:25:17,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 19:25:17,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 19:25:17,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 19:25:17,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 19:25:17,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 19:25:17,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 19:25:17,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 19:25:17,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 19:25:17,640 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 19:25:17,640 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 19:25:17,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 19:25:17,640 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 19:25:17,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 19:25:17,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 19:25:17,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 19:25:17,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 19:25:17,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 19:25:17,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 19:25:17,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 19:25:17,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:25:17,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 19:25:17,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 19:25:17,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 19:25:17,642 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 19:25:17,642 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 19:25:17,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 19:25:17,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 19:25:17,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 19:25:17,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 19:25:17,645 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 -> f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 [2024-11-19 19:25:17,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 19:25:17,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 19:25:17,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 19:25:17,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 19:25:17,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 19:25:17,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-19 19:25:19,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 19:25:19,354 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 19:25:19,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-11-19 19:25:19,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e6e15a1/8e998ab4c219444b8d6e8c358741034e/FLAG6258be43c [2024-11-19 19:25:19,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e6e15a1/8e998ab4c219444b8d6e8c358741034e [2024-11-19 19:25:19,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 19:25:19,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 19:25:19,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 19:25:19,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 19:25:19,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 19:25:19,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552a38b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19, skipping insertion in model container [2024-11-19 19:25:19,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 19:25:19,560 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/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-19 19:25:19,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:25:19,577 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 19:25:19,605 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/float-newlib/double_req_bl_1232a.c[1957,1970] [2024-11-19 19:25:19,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:25:19,624 INFO L204 MainTranslator]: Completed translation [2024-11-19 19:25:19,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19 WrapperNode [2024-11-19 19:25:19,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 19:25:19,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 19:25:19,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 19:25:19,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 19:25:19,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,671 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-19 19:25:19,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 19:25:19,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 19:25:19,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 19:25:19,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 19:25:19,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,701 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-19 19:25:19,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 19:25:19,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 19:25:19,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 19:25:19,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 19:25:19,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (1/1) ... [2024-11-19 19:25:19,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:25:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 19:25:19,762 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 19:25:19,765 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 19:25:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 19:25:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 19:25:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 19:25:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 19:25:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 19:25:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 19:25:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 19:25:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 19:25:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-19 19:25:19,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-19 19:25:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 19:25:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 19:25:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 19:25:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 19:25:19,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 19:25:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 19:25:19,882 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 19:25:19,884 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 19:25:20,060 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-19 19:25:20,060 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 19:25:20,068 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 19:25:20,068 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 19:25:20,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:20 BoogieIcfgContainer [2024-11-19 19:25:20,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 19:25:20,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 19:25:20,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 19:25:20,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 19:25:20,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:25:19" (1/3) ... [2024-11-19 19:25:20,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6872ed15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:20, skipping insertion in model container [2024-11-19 19:25:20,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:19" (2/3) ... [2024-11-19 19:25:20,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6872ed15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:20, skipping insertion in model container [2024-11-19 19:25:20,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:20" (3/3) ... [2024-11-19 19:25:20,079 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2024-11-19 19:25:20,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 19:25:20,091 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 19:25:20,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 19:25:20,143 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;@257bf5c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 19:25:20,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 19:25:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:25:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 19:25:20,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:20,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:20,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:20,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-19 19:25:20,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:20,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611656415] [2024-11-19 19:25:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:20,163 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 19:25:20,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:20,166 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 19:25:20,167 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 19:25:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:20,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 19:25:20,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:20,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:20,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:20,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611656415] [2024-11-19 19:25:20,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611656415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:20,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:20,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 19:25:20,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860122297] [2024-11-19 19:25:20,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:20,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 19:25:20,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 19:25:20,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 19:25:20,301 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:20,315 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-19 19:25:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 19:25:20,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 19:25:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:20,322 INFO L225 Difference]: With dead ends: 51 [2024-11-19 19:25:20,322 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 19:25:20,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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 19:25:20,336 INFO L432 NwaCegarLoop]: 34 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, 34 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 19:25:20,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 19:25:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-19 19:25:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:25:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-19 19:25:20,368 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-19 19:25:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:20,369 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-19 19:25:20,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-19 19:25:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 19:25:20,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:20,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:20,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 19:25:20,572 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 19:25:20,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:20,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:20,575 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-19 19:25:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:20,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543476619] [2024-11-19 19:25:20,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:20,578 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 19:25:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:20,579 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 19:25:20,581 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 19:25:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:20,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:25:20,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:20,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:20,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:20,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543476619] [2024-11-19 19:25:20,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543476619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:20,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:20,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:25:20,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870081125] [2024-11-19 19:25:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:20,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:25:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:20,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:25:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:20,699 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:20,734 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-19 19:25:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:25:20,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 19:25:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:20,736 INFO L225 Difference]: With dead ends: 36 [2024-11-19 19:25:20,737 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 19:25:20,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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 19:25:20,738 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:20,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 19:25:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-19 19:25:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 19:25:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-19 19:25:20,750 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-19 19:25:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:20,751 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-19 19:25:20,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-19 19:25:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 19:25:20,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:20,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:20,757 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 19:25:20,953 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 19:25:20,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:20,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-19 19:25:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:20,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825722829] [2024-11-19 19:25:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:20,958 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 19:25:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:20,960 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 19:25:20,962 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 19:25:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:21,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 19:25:21,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:21,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:21,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825722829] [2024-11-19 19:25:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825722829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:21,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:21,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:25:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218432409] [2024-11-19 19:25:21,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:21,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 19:25:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:21,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 19:25:21,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:25:21,227 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:21,481 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2024-11-19 19:25:21,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 19:25:21,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 19:25:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:21,482 INFO L225 Difference]: With dead ends: 53 [2024-11-19 19:25:21,482 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 19:25:21,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 19:25:21,484 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:21,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 19:25:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 19:25:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-19 19:25:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 19:25:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-19 19:25:21,492 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2024-11-19 19:25:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:21,492 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-19 19:25:21,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-19 19:25:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:25:21,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:21,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:21,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 19:25:21,694 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 19:25:21,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:21,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:21,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1221479789, now seen corresponding path program 1 times [2024-11-19 19:25:21,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:21,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678831496] [2024-11-19 19:25:21,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:21,696 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 19:25:21,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:21,699 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 19:25:21,701 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 19:25:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:21,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:25:21,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:21,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:21,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:21,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678831496] [2024-11-19 19:25:21,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678831496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:21,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:21,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:25:21,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711690671] [2024-11-19 19:25:21,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:21,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:25:21,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:21,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:25:21,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:21,772 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:21,809 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-19 19:25:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:25:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 19:25:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:21,811 INFO L225 Difference]: With dead ends: 41 [2024-11-19 19:25:21,811 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 19:25:21,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 19:25:21,812 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:21,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 19:25:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-19 19:25:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 19:25:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-19 19:25:21,823 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-11-19 19:25:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:21,824 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-19 19:25:21,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-19 19:25:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:25:21,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:21,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:21,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 19:25:22,026 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 19:25:22,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:22,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1991232473, now seen corresponding path program 1 times [2024-11-19 19:25:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472608411] [2024-11-19 19:25:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:22,027 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 19:25:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:22,029 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 19:25:22,031 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 19:25:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:22,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 19:25:22,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:25:22,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:22,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:22,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472608411] [2024-11-19 19:25:22,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472608411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:22,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:22,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:25:22,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659574764] [2024-11-19 19:25:22,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:22,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 19:25:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:22,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 19:25:22,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:25:22,175 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:22,466 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-19 19:25:22,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 19:25:22,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 19:25:22,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:22,469 INFO L225 Difference]: With dead ends: 53 [2024-11-19 19:25:22,469 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 19:25:22,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 19:25:22,470 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:22,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 19:25:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 19:25:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-19 19:25:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 19:25:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-19 19:25:22,480 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2024-11-19 19:25:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:22,480 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-19 19:25:22,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 19:25:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-19 19:25:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 19:25:22,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:22,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:22,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 19:25:22,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 19:25:22,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:22,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:22,683 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-19 19:25:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:22,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073326359] [2024-11-19 19:25:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:22,684 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 19:25:22,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:22,688 INFO L229 MonitoredProcess]: Starting monitored process 7 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 19:25:22,689 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 (7)] Waiting until timeout for monitored process [2024-11-19 19:25:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:22,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:25:22,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 19:25:22,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:22,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:22,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073326359] [2024-11-19 19:25:22,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073326359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:22,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:22,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:25:22,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416483344] [2024-11-19 19:25:22,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:22,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:25:22,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:22,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:25:22,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:22,773 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:22,793 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-19 19:25:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:25:22,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 19:25:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:22,794 INFO L225 Difference]: With dead ends: 38 [2024-11-19 19:25:22,794 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 19:25:22,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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 19:25:22,795 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:22,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 19:25:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-19 19:25:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 19:25:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-19 19:25:22,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 22 [2024-11-19 19:25:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:22,802 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-19 19:25:22,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-19 19:25:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 19:25:22,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:22,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:22,810 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 (7)] Ended with exit code 0 [2024-11-19 19:25:23,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 19:25:23,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:23,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-19 19:25:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:23,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126804313] [2024-11-19 19:25:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:23,006 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 19:25:23,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:23,008 INFO L229 MonitoredProcess]: Starting monitored process 8 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 19:25:23,009 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 (8)] Waiting until timeout for monitored process [2024-11-19 19:25:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:23,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 19:25:23,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 19:25:23,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:23,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126804313] [2024-11-19 19:25:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126804313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:23,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:25:23,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134544151] [2024-11-19 19:25:23,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:25:23,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:23,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:25:23,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:23,111 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:23,136 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-19 19:25:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:25:23,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 19:25:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:23,137 INFO L225 Difference]: With dead ends: 34 [2024-11-19 19:25:23,137 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 19:25:23,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:25:23,138 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:23,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 19:25:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 19:25:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 19:25:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-19 19:25:23,145 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2024-11-19 19:25:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:23,145 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-19 19:25:23,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-19 19:25:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 19:25:23,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:23,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:23,151 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 (8)] Ended with exit code 0 [2024-11-19 19:25:23,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 19:25:23,346 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:23,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-19 19:25:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:23,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596605567] [2024-11-19 19:25:23,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:23,347 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 19:25:23,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:23,349 INFO L229 MonitoredProcess]: Starting monitored process 9 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 19:25:23,350 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 (9)] Waiting until timeout for monitored process [2024-11-19 19:25:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:23,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 19:25:23,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 19:25:23,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:23,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596605567] [2024-11-19 19:25:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596605567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:23,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:23,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:25:23,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997034898] [2024-11-19 19:25:23,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:23,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 19:25:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:23,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 19:25:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:25:23,523 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:23,926 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-19 19:25:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 19:25:23,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-19 19:25:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:23,928 INFO L225 Difference]: With dead ends: 45 [2024-11-19 19:25:23,928 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 19:25:23,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 19:25:23,928 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:23,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 19:25:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 19:25:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 19:25:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 19:25:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-19 19:25:23,933 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 23 [2024-11-19 19:25:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:23,933 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-19 19:25:23,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-19 19:25:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 19:25:23,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:23,934 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:23,938 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 (9)] Ended with exit code 0 [2024-11-19 19:25:24,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 19:25:24,138 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:24,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:24,139 INFO L85 PathProgramCache]: Analyzing trace with hash 178525002, now seen corresponding path program 1 times [2024-11-19 19:25:24,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:24,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925765283] [2024-11-19 19:25:24,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:24,139 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 19:25:24,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:24,140 INFO L229 MonitoredProcess]: Starting monitored process 10 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 19:25:24,141 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 (10)] Waiting until timeout for monitored process [2024-11-19 19:25:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:24,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 19:25:24,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 19:25:24,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:24,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:24,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925765283] [2024-11-19 19:25:24,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925765283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:24,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:24,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:25:24,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181331429] [2024-11-19 19:25:24,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:24,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:25:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:24,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:25:24,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:25:24,213 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:24,230 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-19 19:25:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:25:24,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-19 19:25:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:24,231 INFO L225 Difference]: With dead ends: 41 [2024-11-19 19:25:24,231 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 19:25:24,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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 19:25:24,232 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:24,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 19:25:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-19 19:25:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 19:25:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-19 19:25:24,235 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 24 [2024-11-19 19:25:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:24,235 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-19 19:25:24,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-19 19:25:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 19:25:24,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:24,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:24,240 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 (10)] Ended with exit code 0 [2024-11-19 19:25:24,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 19:25:24,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:24,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1847075342, now seen corresponding path program 1 times [2024-11-19 19:25:24,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:24,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077693506] [2024-11-19 19:25:24,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:24,441 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 19:25:24,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:24,444 INFO L229 MonitoredProcess]: Starting monitored process 11 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 19:25:24,445 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 (11)] Waiting until timeout for monitored process [2024-11-19 19:25:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:24,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 19:25:24,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 19:25:24,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:24,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:24,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077693506] [2024-11-19 19:25:24,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077693506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:24,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:24,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:25:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742468873] [2024-11-19 19:25:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:24,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 19:25:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:24,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 19:25:24,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 19:25:24,588 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:25,036 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-19 19:25:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 19:25:25,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-19 19:25:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:25,038 INFO L225 Difference]: With dead ends: 38 [2024-11-19 19:25:25,038 INFO L226 Difference]: Without dead ends: 23 [2024-11-19 19:25:25,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 19:25:25,039 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:25,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 19:25:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-19 19:25:25,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-19 19:25:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 19:25:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-19 19:25:25,044 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 25 [2024-11-19 19:25:25,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:25,044 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-19 19:25:25,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-19 19:25:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 19:25:25,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:25:25,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:25,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 19:25:25,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 19:25:25,246 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:25:25,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:25:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-19 19:25:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:25:25,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654995598] [2024-11-19 19:25:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:25:25,246 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 19:25:25,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:25:25,247 INFO L229 MonitoredProcess]: Starting monitored process 12 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 19:25:25,248 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 (12)] Waiting until timeout for monitored process [2024-11-19 19:25:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:25:25,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 19:25:25,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:25:25,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 19:25:25,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:25:25,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:25:25,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654995598] [2024-11-19 19:25:25,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654995598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:25:25,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:25:25,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 19:25:25,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803100895] [2024-11-19 19:25:25,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:25:25,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 19:25:25,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:25:25,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 19:25:25,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 19:25:25,412 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:25:25,474 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-11-19 19:25:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 19:25:25,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-19 19:25:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:25:25,475 INFO L225 Difference]: With dead ends: 23 [2024-11-19 19:25:25,475 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 19:25:25,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 19:25:25,476 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:25:25,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 119 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:25:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 19:25:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 19:25:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:25:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 19:25:25,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-19 19:25:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:25:25,478 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 19:25:25,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 19:25:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 19:25:25,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 19:25:25,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 19:25:25,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 19:25:25,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 19:25:25,687 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:25:25,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 19:25:25,839 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 19:25:25,853 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 19:25:25,854 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 19:25:25,854 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 19:25:25,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:25:25 BoogieIcfgContainer [2024-11-19 19:25:25,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 19:25:25,858 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 19:25:25,858 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 19:25:25,858 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 19:25:25,859 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:20" (3/4) ... [2024-11-19 19:25:25,860 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 19:25:25,863 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-11-19 19:25:25,866 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-19 19:25:25,866 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-19 19:25:25,866 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 19:25:25,867 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 19:25:25,937 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 19:25:25,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 19:25:25,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 19:25:25,939 INFO L158 Benchmark]: Toolchain (without parser) took 6565.11ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 44.0MB in the beginning and 47.6MB in the end (delta: -3.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-19 19:25:25,939 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 52.4MB. Free memory is still 25.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:25:25,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.03ms. Allocated memory is still 83.9MB. Free memory was 43.7MB in the beginning and 29.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 19:25:25,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.44ms. Allocated memory is still 83.9MB. Free memory was 29.9MB in the beginning and 61.8MB in the end (delta: -31.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-19 19:25:25,940 INFO L158 Benchmark]: Boogie Preprocessor took 52.39ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 59.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 19:25:25,941 INFO L158 Benchmark]: RCFGBuilder took 342.09ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 44.5MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 19:25:25,941 INFO L158 Benchmark]: TraceAbstraction took 5787.57ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 43.8MB in the beginning and 52.0MB in the end (delta: -8.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-19 19:25:25,941 INFO L158 Benchmark]: Witness Printer took 80.35ms. Allocated memory is still 102.8MB. Free memory was 52.0MB in the beginning and 47.6MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 19:25:25,942 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 52.4MB. Free memory is still 25.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.03ms. Allocated memory is still 83.9MB. Free memory was 43.7MB in the beginning and 29.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.44ms. Allocated memory is still 83.9MB. Free memory was 29.9MB in the beginning and 61.8MB in the end (delta: -31.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.39ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 59.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 342.09ms. Allocated memory is still 83.9MB. Free memory was 59.5MB in the beginning and 44.5MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5787.57ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 43.8MB in the beginning and 52.0MB in the end (delta: -8.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Witness Printer took 80.35ms. Allocated memory is still 102.8MB. Free memory was 52.0MB in the beginning and 47.6MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 82]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 885 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 610 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 275 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 206 ConstructedInterpolants, 26 QuantifiedInterpolants, 849 SizeOfPredicates, 17 NumberOfNonLiveVariables, 780 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 36/36 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-19 19:25:25,967 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 Writing output log to file Ultimate.log Result: TRUE