./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:48:35,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:48:35,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:48:35,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:48:35,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:48:35,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:48:35,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:48:35,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:48:35,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:48:35,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:48:35,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:48:35,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:48:35,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:48:35,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:48:35,122 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:48:35,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:48:35,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:48:35,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:48:35,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:48:35,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:48:35,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:48:35,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:48:35,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:48:35,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:48:35,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:48:35,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:48:35,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:48:35,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:48:35,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:48:35,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:48:35,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:48:35,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:48:35,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:48:35,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:48:35,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:48:35,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:48:35,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:48:35,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:48:35,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:48:35,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:48:35,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:48:35,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:48:35,132 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-clean/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-clean/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 -> 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953 [2024-10-11 13:48:35,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:48:35,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:48:35,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:48:35,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:48:35,429 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:48:35,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i [2024-10-11 13:48:36,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:48:37,099 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:48:37,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i [2024-10-11 13:48:37,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7416b464b/d0c8edaf3fe64a07817abd2dea8a23d5/FLAGe5bdc44f8 [2024-10-11 13:48:37,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7416b464b/d0c8edaf3fe64a07817abd2dea8a23d5 [2024-10-11 13:48:37,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:48:37,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:48:37,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:48:37,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:48:37,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:48:37,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37, skipping insertion in model container [2024-10-11 13:48:37,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:48:37,342 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i[916,929] [2024-10-11 13:48:37,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:48:37,402 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:48:37,413 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i[916,929] [2024-10-11 13:48:37,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:48:37,463 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:48:37,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37 WrapperNode [2024-10-11 13:48:37,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:48:37,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:48:37,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:48:37,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:48:37,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,526 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2024-10-11 13:48:37,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:48:37,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:48:37,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:48:37,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:48:37,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,577 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-11 13:48:37,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:48:37,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:48:37,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:48:37,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:48:37,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (1/1) ... [2024-10-11 13:48:37,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:48:37,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:48:37,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:48:37,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:48:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:48:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:48:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:48:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:48:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:48:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:48:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:48:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:48:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:48:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:48:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:48:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:48:37,721 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:48:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:48:37,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:48:37,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:48:37,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:48:37,844 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:48:37,846 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:48:38,293 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-11 13:48:38,293 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:48:38,331 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:48:38,331 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:48:38,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:48:38 BoogieIcfgContainer [2024-10-11 13:48:38,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:48:38,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:48:38,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:48:38,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:48:38,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:48:37" (1/3) ... [2024-10-11 13:48:38,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd9dadc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:48:38, skipping insertion in model container [2024-10-11 13:48:38,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:37" (2/3) ... [2024-10-11 13:48:38,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd9dadc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:48:38, skipping insertion in model container [2024-10-11 13:48:38,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:48:38" (3/3) ... [2024-10-11 13:48:38,345 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-42.i [2024-10-11 13:48:38,360 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:48:38,360 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:48:38,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:48:38,418 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;@4a1eb5ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:48:38,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:48:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:38,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:38,436 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:38,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:38,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:38,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2082484620, now seen corresponding path program 1 times [2024-10-11 13:48:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:38,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206661242] [2024-10-11 13:48:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:38,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:38,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206661242] [2024-10-11 13:48:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206661242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:38,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:48:38,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146911219] [2024-10-11 13:48:38,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:38,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:48:38,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:38,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:48:38,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:48:38,928 INFO L87 Difference]: Start difference. First operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:48:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:38,977 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2024-10-11 13:48:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:48:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:48:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:38,989 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:48:38,989 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:48:38,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:48:38,997 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:38,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:48:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:48:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 13:48:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-10-11 13:48:39,052 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 98 [2024-10-11 13:48:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:39,052 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-10-11 13:48:39,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:48:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-10-11 13:48:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:39,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:39,061 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:39,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:48:39,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:39,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 378438938, now seen corresponding path program 1 times [2024-10-11 13:48:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:39,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050756576] [2024-10-11 13:48:39,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:39,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:39,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050756576] [2024-10-11 13:48:39,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050756576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:39,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:39,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:48:39,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424940903] [2024-10-11 13:48:39,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:39,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:48:39,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:48:39,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:48:39,394 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:48:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:39,449 INFO L93 Difference]: Finished difference Result 183 states and 262 transitions. [2024-10-11 13:48:39,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:48:39,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:48:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:39,451 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:48:39,451 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:48:39,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10-11 13:48:39,453 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:39,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:48:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:48:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:48:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-10-11 13:48:39,468 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 98 [2024-10-11 13:48:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:39,470 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-10-11 13:48:39,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:48:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-10-11 13:48:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:39,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:39,473 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:39,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:48:39,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:39,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2037397412, now seen corresponding path program 1 times [2024-10-11 13:48:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44594440] [2024-10-11 13:48:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:40,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:40,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44594440] [2024-10-11 13:48:40,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44594440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:40,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:40,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:48:40,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464811659] [2024-10-11 13:48:40,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:40,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:48:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:40,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:48:40,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:48:40,169 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:40,337 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2024-10-11 13:48:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:48:40,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:48:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:40,342 INFO L225 Difference]: With dead ends: 185 [2024-10-11 13:48:40,342 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:48:40,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10-11 13:48:40,344 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:40,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:48:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:48:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:48:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-10-11 13:48:40,360 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 98 [2024-10-11 13:48:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:40,362 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-10-11 13:48:40,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-10-11 13:48:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:40,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:40,366 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:40,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:48:40,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:40,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2123556378, now seen corresponding path program 1 times [2024-10-11 13:48:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:40,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57448312] [2024-10-11 13:48:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:40,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57448312] [2024-10-11 13:48:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57448312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:40,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:40,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:48:40,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611622495] [2024-10-11 13:48:40,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:40,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:48:40,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:48:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:48:40,751 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:40,857 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2024-10-11 13:48:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:48:40,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:48:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:40,860 INFO L225 Difference]: With dead ends: 185 [2024-10-11 13:48:40,860 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:48:40,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10-11 13:48:40,863 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:40,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:48:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:48:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:48:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-10-11 13:48:40,875 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 98 [2024-10-11 13:48:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:40,875 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-10-11 13:48:40,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-10-11 13:48:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:40,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:40,880 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:40,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:48:40,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:40,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1536750364, now seen corresponding path program 1 times [2024-10-11 13:48:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:40,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404541379] [2024-10-11 13:48:40,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:42,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:42,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404541379] [2024-10-11 13:48:42,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404541379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:42,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:42,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:48:42,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120842167] [2024-10-11 13:48:42,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:42,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:48:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:42,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:48:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:48:42,406 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:48:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:42,739 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2024-10-11 13:48:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:48:42,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:48:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:42,741 INFO L225 Difference]: With dead ends: 188 [2024-10-11 13:48:42,742 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 13:48:42,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:48:42,743 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 64 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:42,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 449 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:48:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 13:48:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-11 13:48:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-10-11 13:48:42,754 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 98 [2024-10-11 13:48:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:42,754 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-10-11 13:48:42,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:48:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-10-11 13:48:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:42,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:42,756 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:42,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:48:42,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:42,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1143723354, now seen corresponding path program 1 times [2024-10-11 13:48:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:42,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279626178] [2024-10-11 13:48:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:48:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:43,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279626178] [2024-10-11 13:48:43,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279626178] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:48:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004541171] [2024-10-11 13:48:43,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:43,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:48:43,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:48:43,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:48:43,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:48:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 13:48:43,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:48:43,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2024-10-11 13:48:43,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:43,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-10-11 13:48:43,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:43,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2024-10-11 13:48:44,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:44,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-10-11 13:48:44,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:44,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-10-11 13:48:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:48:44,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:48:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:44,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004541171] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:48:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:48:44,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 11] total 20 [2024-10-11 13:48:44,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408350906] [2024-10-11 13:48:44,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:44,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:48:44,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:44,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:48:44,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:48:44,345 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:44,768 INFO L93 Difference]: Finished difference Result 285 states and 397 transitions. [2024-10-11 13:48:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:48:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:48:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:44,771 INFO L225 Difference]: With dead ends: 285 [2024-10-11 13:48:44,771 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 13:48:44,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:48:44,774 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 110 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:44,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 766 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:48:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 13:48:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 115. [2024-10-11 13:48:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2024-10-11 13:48:44,790 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 98 [2024-10-11 13:48:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:44,794 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2024-10-11 13:48:44,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2024-10-11 13:48:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:44,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:44,796 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:44,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:48:44,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:48:44,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:44,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:44,998 INFO L85 PathProgramCache]: Analyzing trace with hash -830495007, now seen corresponding path program 1 times [2024-10-11 13:48:44,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:44,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008452629] [2024-10-11 13:48:44,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:44,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:45,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:45,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008452629] [2024-10-11 13:48:45,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008452629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:45,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:45,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:48:45,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102474993] [2024-10-11 13:48:45,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:45,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:48:45,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:45,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:48:45,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:48:45,237 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:45,322 INFO L93 Difference]: Finished difference Result 229 states and 319 transitions. [2024-10-11 13:48:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:48:45,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:48:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:45,326 INFO L225 Difference]: With dead ends: 229 [2024-10-11 13:48:45,326 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 13:48:45,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10-11 13:48:45,327 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:45,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:48:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 13:48:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 13:48:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2024-10-11 13:48:45,341 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 98 [2024-10-11 13:48:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:45,342 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2024-10-11 13:48:45,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2024-10-11 13:48:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:45,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:45,343 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:45,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:48:45,344 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:45,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:45,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1417301021, now seen corresponding path program 1 times [2024-10-11 13:48:45,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:45,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377240529] [2024-10-11 13:48:45,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:45,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:45,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377240529] [2024-10-11 13:48:45,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377240529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:45,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:45,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:48:45,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937418510] [2024-10-11 13:48:45,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:45,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:48:45,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:45,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:48:45,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:48:45,493 INFO L87 Difference]: Start difference. First operand 115 states and 159 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:45,514 INFO L93 Difference]: Finished difference Result 227 states and 315 transitions. [2024-10-11 13:48:45,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:48:45,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:48:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:45,517 INFO L225 Difference]: With dead ends: 227 [2024-10-11 13:48:45,517 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 13:48:45,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:48:45,518 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 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-10-11 13:48:45,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:48:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 13:48:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 13:48:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.33) internal successors, (133), 100 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2024-10-11 13:48:45,524 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 155 transitions. Word has length 98 [2024-10-11 13:48:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:45,524 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 155 transitions. [2024-10-11 13:48:45,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2024-10-11 13:48:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:45,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:45,526 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:45,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:48:45,526 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:45,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:45,527 INFO L85 PathProgramCache]: Analyzing trace with hash 782866803, now seen corresponding path program 1 times [2024-10-11 13:48:45,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:45,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237632686] [2024-10-11 13:48:45,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:45,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237632686] [2024-10-11 13:48:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237632686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:45,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:45,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:48:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975271145] [2024-10-11 13:48:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:45,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:48:45,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:45,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:48:45,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:48:45,700 INFO L87 Difference]: Start difference. First operand 113 states and 155 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:45,780 INFO L93 Difference]: Finished difference Result 225 states and 309 transitions. [2024-10-11 13:48:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:48:45,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:48:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:45,782 INFO L225 Difference]: With dead ends: 225 [2024-10-11 13:48:45,782 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 13:48:45,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10-11 13:48:45,783 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:45,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:48:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 13:48:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 13:48:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2024-10-11 13:48:45,788 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 98 [2024-10-11 13:48:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:45,789 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2024-10-11 13:48:45,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2024-10-11 13:48:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:45,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:45,790 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:45,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:48:45,791 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:45,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash 648853297, now seen corresponding path program 1 times [2024-10-11 13:48:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:45,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093550548] [2024-10-11 13:48:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093550548] [2024-10-11 13:48:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093550548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:45,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:45,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:48:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963060029] [2024-10-11 13:48:45,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:45,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:48:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:45,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:48:45,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:48:45,911 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:45,926 INFO L93 Difference]: Finished difference Result 201 states and 274 transitions. [2024-10-11 13:48:45,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:48:45,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:48:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:45,927 INFO L225 Difference]: With dead ends: 201 [2024-10-11 13:48:45,927 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 13:48:45,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:48:45,928 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 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-10-11 13:48:45,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:48:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 13:48:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 13:48:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 76 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2024-10-11 13:48:45,932 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 98 [2024-10-11 13:48:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:45,932 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2024-10-11 13:48:45,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2024-10-11 13:48:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:48:45,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:45,933 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:45,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:48:45,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:45,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash -465305983, now seen corresponding path program 1 times [2024-10-11 13:48:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896067965] [2024-10-11 13:48:45,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:45,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:48:46,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:46,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896067965] [2024-10-11 13:48:46,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896067965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:48:46,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378490075] [2024-10-11 13:48:46,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:46,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:48:46,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:48:46,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:48:46,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:48:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:46,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 13:48:46,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:48:46,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 13:48:46,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-11 13:48:47,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-11 13:48:47,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-11 13:48:47,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:47,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-11 13:48:47,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:47,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-10-11 13:48:47,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:47,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 40 [2024-10-11 13:48:47,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:47,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-10-11 13:48:47,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:47,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 30 [2024-10-11 13:48:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-11 13:48:47,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:48:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:48:47,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378490075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:48:47,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:48:47,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2024-10-11 13:48:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856966853] [2024-10-11 13:48:47,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:48:47,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:48:47,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:47,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:48:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:48:47,509 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 15 states, 12 states have (on average 8.0) internal successors, (96), 15 states have internal predecessors, (96), 7 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 7 states have call successors, (29) [2024-10-11 13:48:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:48,092 INFO L93 Difference]: Finished difference Result 186 states and 247 transitions. [2024-10-11 13:48:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:48:48,092 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.0) internal successors, (96), 15 states have internal predecessors, (96), 7 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 7 states have call successors, (29) Word has length 100 [2024-10-11 13:48:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:48,093 INFO L225 Difference]: With dead ends: 186 [2024-10-11 13:48:48,093 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 13:48:48,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 213 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:48:48,095 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 217 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:48,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 300 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:48:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 13:48:48,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-10-11 13:48:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2024-10-11 13:48:48,103 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 100 [2024-10-11 13:48:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:48,104 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2024-10-11 13:48:48,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.0) internal successors, (96), 15 states have internal predecessors, (96), 7 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 7 states have call successors, (29) [2024-10-11 13:48:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2024-10-11 13:48:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:48:48,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:48,105 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:48,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:48:48,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:48:48,310 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:48,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1299005446, now seen corresponding path program 1 times [2024-10-11 13:48:48,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:48,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687107946] [2024-10-11 13:48:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:48:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:48:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:48:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:48:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:48:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:48:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:48:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:48:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:48,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:48,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687107946] [2024-10-11 13:48:48,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687107946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:48,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:48,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:48:48,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523838950] [2024-10-11 13:48:48,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:48,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:48:48,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:48,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:48:48,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:48:48,652 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:48,856 INFO L93 Difference]: Finished difference Result 185 states and 243 transitions. [2024-10-11 13:48:48,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:48:48,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-11 13:48:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:48,858 INFO L225 Difference]: With dead ends: 185 [2024-10-11 13:48:48,858 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:48:48,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:48:48,859 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 99 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:48,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 226 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:48:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:48:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:48:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2024-10-11 13:48:48,865 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 100 [2024-10-11 13:48:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:48,865 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2024-10-11 13:48:48,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2024-10-11 13:48:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:48:48,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:48,867 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:48,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:48:48,867 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:48,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash 389938296, now seen corresponding path program 1 times [2024-10-11 13:48:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:48,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496380859] [2024-10-11 13:48:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:48:48,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:48:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:48:49,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:48:49,104 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:48:49,105 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:48:49,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:48:49,111 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:49,186 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:48:49,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:48:49 BoogieIcfgContainer [2024-10-11 13:48:49,190 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:48:49,190 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:48:49,190 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:48:49,191 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:48:49,191 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:48:38" (3/4) ... [2024-10-11 13:48:49,193 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:48:49,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:48:49,195 INFO L158 Benchmark]: Toolchain (without parser) took 12063.54ms. Allocated memory was 163.6MB in the beginning and 358.6MB in the end (delta: 195.0MB). Free memory was 131.7MB in the beginning and 292.8MB in the end (delta: -161.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-10-11 13:48:49,195 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:48:49,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.76ms. Allocated memory is still 163.6MB. Free memory was 131.7MB in the beginning and 114.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:48:49,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.68ms. Allocated memory is still 163.6MB. Free memory was 114.8MB in the beginning and 110.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:48:49,196 INFO L158 Benchmark]: Boogie Preprocessor took 92.56ms. Allocated memory is still 163.6MB. Free memory was 110.7MB in the beginning and 105.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:48:49,196 INFO L158 Benchmark]: RCFGBuilder took 712.71ms. Allocated memory is still 163.6MB. Free memory was 105.9MB in the beginning and 70.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 13:48:49,196 INFO L158 Benchmark]: TraceAbstraction took 10854.49ms. Allocated memory was 163.6MB in the beginning and 358.6MB in the end (delta: 195.0MB). Free memory was 69.7MB in the beginning and 292.8MB in the end (delta: -223.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:48:49,197 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 358.6MB. Free memory is still 292.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:48:49,199 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.19ms. Allocated memory is still 163.6MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.76ms. Allocated memory is still 163.6MB. Free memory was 131.7MB in the beginning and 114.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.68ms. Allocated memory is still 163.6MB. Free memory was 114.8MB in the beginning and 110.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.56ms. Allocated memory is still 163.6MB. Free memory was 110.7MB in the beginning and 105.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 712.71ms. Allocated memory is still 163.6MB. Free memory was 105.9MB in the beginning and 70.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10854.49ms. Allocated memory was 163.6MB in the beginning and 358.6MB in the end (delta: 195.0MB). Free memory was 69.7MB in the beginning and 292.8MB in the end (delta: -223.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 358.6MB. Free memory is still 292.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L77] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L78] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L78] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L79] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L80] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L81] EXPR WrapperStruct00.var_1_11 [L81] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L81] EXPR WrapperStruct00.var_1_11 [L81] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L81] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L82] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L83] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L86] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] RET updateVariables() [L107] CALL step() [L52] EXPR WrapperStruct00.var_1_9 [L52] WrapperStruct00.var_1_8 = (WrapperStruct00.var_1_9 + 100) [L53] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L53] EXPR ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f) [L53] EXPR WrapperStruct00.var_1_11 [L53] EXPR ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f) VAL [WrapperStruct00={4:0}, isInitial=1] [L53] WrapperStruct00.var_1_10 = ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f))) [L54] EXPR WrapperStruct00.var_1_8 [L54] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L54] COND FALSE !(WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) [L57] EXPR WrapperStruct00.var_1_8 [L57] EXPR WrapperStruct00.var_1_8 [L57] EXPR WrapperStruct00.var_1_8 [L57] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L57] EXPR (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) [L57] EXPR WrapperStruct00.var_1_8 [L57] EXPR WrapperStruct00.var_1_8 [L57] EXPR (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L57] WrapperStruct00.var_1_1 = (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)))) [L59] EXPR WrapperStruct00.var_1_11 [L59] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L59] COND TRUE WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10 [L60] EXPR WrapperStruct00.var_1_1 [L60] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] COND TRUE WrapperStruct00.var_1_1 != WrapperStruct00.var_1_8 [L61] EXPR WrapperStruct00.var_1_18 [L61] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L70] EXPR WrapperStruct00.var_1_10 [L70] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND FALSE !((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) [L73] EXPR WrapperStruct00.var_1_1 [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR (WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L73] EXPR (WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16 [L73] EXPR WrapperStruct00.var_1_16 [L73] EXPR (WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L73] WrapperStruct00.var_1_12 = ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)))))) [L98] EXPR WrapperStruct00.var_1_1 [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR ((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR ((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100))) [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_9 [L98] EXPR ((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f))))) [L98] EXPR WrapperStruct00.var_1_10 [L98] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f) [L98] EXPR WrapperStruct00.var_1_11 [L98] EXPR ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR ((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR ((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16))))) && ((WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18)) : 1) : ((WrapperStruct00.var_1_8 <= 1000000) ? (WrapperStruct00.var_1_17 == ((unsigned char) 0)) : (WrapperStruct00.var_1_17 == ((unsigned char) 0)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16))))) && ((WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18)) : 1) : ((WrapperStruct00.var_1_8 <= 1000000) ? (WrapperStruct00.var_1_17 == ((unsigned char) 0)) : (WrapperStruct00.var_1_17 == ((unsigned char) 0)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98-L99] return (((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16))))) && ((WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18)) : 1) : ((WrapperStruct00.var_1_8 <= 1000000) ? (WrapperStruct00.var_1_17 == ((unsigned char) 0)) : (WrapperStruct00.var_1_17 == ((unsigned char) 0)))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 490 mSDsluCounter, 3912 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2644 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1959 IncrementalHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 1268 mSDtfsCounter, 1959 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 771 GetRequests, 690 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=6, InterpolantAutomatonStates: 65, 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, 12 MinimizatonAttempts, 82 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1478 NumberOfCodeBlocks, 1478 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1560 ConstructedInterpolants, 0 QuantifiedInterpolants, 4764 SizeOfPredicates, 11 NumberOfNonLiveVariables, 715 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 3418/3520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:48:49,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:48:51,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:48:51,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:48:51,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:48:51,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:48:51,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:48:51,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:48:51,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:48:51,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:48:51,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:48:51,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:48:51,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:48:51,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:48:51,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:48:51,747 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:48:51,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:48:51,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:48:51,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:48:51,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:48:51,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:48:51,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:48:51,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:48:51,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:48:51,752 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:48:51,752 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:48:51,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:48:51,753 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:48:51,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:48:51,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:48:51,754 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:48:51,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:48:51,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:48:51,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:48:51,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:48:51,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:48:51,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:48:51,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:48:51,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:48:51,756 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:48:51,756 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:48:51,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:48:51,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:48:51,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:48:51,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:48:51,759 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:48:51,759 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-clean/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-clean/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 -> 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953 [2024-10-11 13:48:52,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:48:52,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:48:52,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:48:52,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:48:52,126 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:48:52,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i [2024-10-11 13:48:53,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:48:53,846 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:48:53,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i [2024-10-11 13:48:53,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b9314ed64/df018498f5034529b45230bd0d65bd54/FLAG5ffa03174 [2024-10-11 13:48:54,207 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b9314ed64/df018498f5034529b45230bd0d65bd54 [2024-10-11 13:48:54,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:48:54,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:48:54,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:48:54,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:48:54,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:48:54,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2799f841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54, skipping insertion in model container [2024-10-11 13:48:54,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:48:54,428 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i[916,929] [2024-10-11 13:48:54,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:48:54,516 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:48:54,537 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i[916,929] [2024-10-11 13:48:54,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:48:54,607 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:48:54,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54 WrapperNode [2024-10-11 13:48:54,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:48:54,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:48:54,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:48:54,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:48:54,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,689 INFO L138 Inliner]: procedures = 33, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2024-10-11 13:48:54,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:48:54,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:48:54,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:48:54,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:48:54,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,735 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-11 13:48:54,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:48:54,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:48:54,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:48:54,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:48:54,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (1/1) ... [2024-10-11 13:48:54,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:48:54,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:48:54,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:48:54,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:48:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:48:54,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:48:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:48:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:48:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:48:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:48:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:48:54,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:48:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:48:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:48:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:48:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:48:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:48:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:48:54,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:48:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:48:54,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:48:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:48:54,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:48:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:48:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:48:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:48:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:48:54,980 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:48:54,982 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:48:55,616 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-11 13:48:55,617 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:48:55,670 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:48:55,671 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:48:55,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:48:55 BoogieIcfgContainer [2024-10-11 13:48:55,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:48:55,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:48:55,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:48:55,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:48:55,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:48:54" (1/3) ... [2024-10-11 13:48:55,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a03da35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:48:55, skipping insertion in model container [2024-10-11 13:48:55,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:54" (2/3) ... [2024-10-11 13:48:55,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a03da35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:48:55, skipping insertion in model container [2024-10-11 13:48:55,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:48:55" (3/3) ... [2024-10-11 13:48:55,682 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-42.i [2024-10-11 13:48:55,698 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:48:55,698 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:48:55,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:48:55,764 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;@d40da66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:48:55,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:48:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:55,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:55,784 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:55,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:55,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2082484620, now seen corresponding path program 1 times [2024-10-11 13:48:55,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:48:55,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206669799] [2024-10-11 13:48:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:55,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:48:55,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:48:55,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:48:55,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:48:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:56,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:48:56,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:48:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-11 13:48:56,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:48:56,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:48:56,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206669799] [2024-10-11 13:48:56,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206669799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:56,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:56,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:48:56,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941135653] [2024-10-11 13:48:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:56,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:48:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:48:56,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:48:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:48:56,179 INFO L87 Difference]: Start difference. First operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:48:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:56,244 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2024-10-11 13:48:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:48:56,248 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:48:56,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:56,257 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:48:56,257 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:48:56,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:48:56,266 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:56,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:48:56,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:48:56,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 13:48:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-10-11 13:48:56,305 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 98 [2024-10-11 13:48:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:56,306 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-10-11 13:48:56,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:48:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-10-11 13:48:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:56,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:56,310 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:56,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:48:56,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:48:56,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:56,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash 378438938, now seen corresponding path program 1 times [2024-10-11 13:48:56,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:48:56,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594202178] [2024-10-11 13:48:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:56,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:48:56,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:48:56,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:48:56,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:48:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:56,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:48:56,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:48:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-11 13:48:56,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:48:56,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:48:56,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594202178] [2024-10-11 13:48:56,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594202178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:56,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:56,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:48:56,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180310316] [2024-10-11 13:48:56,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:56,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:48:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:48:56,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:48:56,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:48:56,787 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:48:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:56,863 INFO L93 Difference]: Finished difference Result 183 states and 262 transitions. [2024-10-11 13:48:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:48:56,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:48:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:56,866 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:48:56,866 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:48:56,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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-10-11 13:48:56,868 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:56,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:48:56,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:48:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:48:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-10-11 13:48:56,880 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 98 [2024-10-11 13:48:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:56,882 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-10-11 13:48:56,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:48:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-10-11 13:48:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:56,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:56,885 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:56,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:48:57,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:48:57,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:57,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:57,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2037397412, now seen corresponding path program 1 times [2024-10-11 13:48:57,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:48:57,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914201072] [2024-10-11 13:48:57,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:57,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:48:57,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:48:57,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:48:57,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:48:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:57,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:48:57,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:48:57,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2024-10-11 13:48:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:57,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:48:57,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:48:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914201072] [2024-10-11 13:48:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914201072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:57,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:57,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:48:57,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953171454] [2024-10-11 13:48:57,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:57,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:48:57,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:48:57,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:48:57,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:48:57,393 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:57,454 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2024-10-11 13:48:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:48:57,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:48:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:57,456 INFO L225 Difference]: With dead ends: 185 [2024-10-11 13:48:57,457 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:48:57,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:48:57,462 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:57,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:48:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:48:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:48:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-10-11 13:48:57,472 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 98 [2024-10-11 13:48:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:57,473 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-10-11 13:48:57,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-10-11 13:48:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:57,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:57,479 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:57,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:48:57,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:48:57,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:57,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:57,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2123556378, now seen corresponding path program 1 times [2024-10-11 13:48:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:48:57,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702097419] [2024-10-11 13:48:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:57,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:48:57,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:48:57,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:48:57,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:48:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:57,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:48:57,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:48:57,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2024-10-11 13:48:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:48:57,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:48:57,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:48:57,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702097419] [2024-10-11 13:48:57,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702097419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:57,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:57,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:48:57,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440956971] [2024-10-11 13:48:57,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:57,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:48:57,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:48:57,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:48:57,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:48:57,959 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:58,009 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2024-10-11 13:48:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:48:58,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:48:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:58,018 INFO L225 Difference]: With dead ends: 185 [2024-10-11 13:48:58,020 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:48:58,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:48:58,022 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 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-10-11 13:48:58,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:48:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:48:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:48:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:48:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-10-11 13:48:58,033 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 98 [2024-10-11 13:48:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:58,034 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-10-11 13:48:58,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:48:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-10-11 13:48:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:48:58,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:58,039 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:58,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 13:48:58,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:48:58,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:58,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1536750364, now seen corresponding path program 1 times [2024-10-11 13:48:58,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:48:58,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815911145] [2024-10-11 13:48:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:58,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:48:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:48:58,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:48:58,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:48:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:58,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 13:48:58,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:48:58,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:48:58,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-11 13:48:58,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:58,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-11 13:48:58,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:58,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-11 13:48:59,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:59,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 65 [2024-10-11 13:48:59,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:59,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 68 [2024-10-11 13:48:59,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:59,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 68 [2024-10-11 13:48:59,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:59,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 79 [2024-10-11 13:48:59,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:59,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 43 [2024-10-11 13:48:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 146 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 13:48:59,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:48:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:48:59,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:48:59,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815911145] [2024-10-11 13:48:59,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815911145] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:48:59,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:48:59,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2024-10-11 13:48:59,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122346626] [2024-10-11 13:48:59,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:48:59,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:48:59,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:48:59,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:48:59,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:48:59,867 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 14 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 13:49:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:01,341 INFO L93 Difference]: Finished difference Result 248 states and 339 transitions. [2024-10-11 13:49:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 13:49:01,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 98 [2024-10-11 13:49:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:01,344 INFO L225 Difference]: With dead ends: 248 [2024-10-11 13:49:01,344 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 13:49:01,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:49:01,346 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 494 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:01,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 279 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 13:49:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 13:49:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 101. [2024-10-11 13:49:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:49:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2024-10-11 13:49:01,359 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 98 [2024-10-11 13:49:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:01,360 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2024-10-11 13:49:01,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 13:49:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2024-10-11 13:49:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:49:01,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:01,362 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:01,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:01,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:01,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:01,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash -747913515, now seen corresponding path program 1 times [2024-10-11 13:49:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:01,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682044520] [2024-10-11 13:49:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:01,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:01,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:01,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:01,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:01,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 13:49:01,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:01,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:49:01,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-11 13:49:01,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-11 13:49:02,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:02,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-11 13:49:02,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:02,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-11 13:49:02,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:02,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-11 13:49:02,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:02,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 69 [2024-10-11 13:49:02,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:02,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 72 [2024-10-11 13:49:02,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:02,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 72 [2024-10-11 13:49:02,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:02,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 83 [2024-10-11 13:49:02,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:02,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 86 [2024-10-11 13:49:03,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:03,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 133 treesize of output 61 [2024-10-11 13:49:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 160 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 13:49:03,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:49:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:49:03,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682044520] [2024-10-11 13:49:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682044520] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:49:03,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:49:03,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 14 [2024-10-11 13:49:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156770080] [2024-10-11 13:49:03,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:03,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:49:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:03,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:49:03,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:49:03,475 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:03,783 INFO L93 Difference]: Finished difference Result 204 states and 273 transitions. [2024-10-11 13:49:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:49:03,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:49:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:03,785 INFO L225 Difference]: With dead ends: 204 [2024-10-11 13:49:03,785 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 13:49:03,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:49:03,786 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 63 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:03,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 259 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:49:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 13:49:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-11 13:49:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:49:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2024-10-11 13:49:03,801 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 98 [2024-10-11 13:49:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:03,804 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2024-10-11 13:49:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2024-10-11 13:49:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:49:03,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:03,806 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:03,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:49:04,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:04,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:04,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:04,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1140940525, now seen corresponding path program 1 times [2024-10-11 13:49:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:04,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709147806] [2024-10-11 13:49:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:04,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:04,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:04,012 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:04,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:04,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 13:49:04,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:04,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:49:04,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-11 13:49:04,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-11 13:49:04,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-11 13:49:04,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-11 13:49:04,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:04,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-11 13:49:04,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:04,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-10-11 13:49:04,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:04,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2024-10-11 13:49:04,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:04,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 60 [2024-10-11 13:49:04,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:04,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 83 [2024-10-11 13:49:04,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:04,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 123 treesize of output 51 [2024-10-11 13:49:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 128 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-11 13:49:05,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:49:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:49:05,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:05,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709147806] [2024-10-11 13:49:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709147806] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:49:05,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:49:05,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2024-10-11 13:49:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719585034] [2024-10-11 13:49:05,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:05,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:49:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:05,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:49:05,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:49:05,155 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:05,496 INFO L93 Difference]: Finished difference Result 259 states and 347 transitions. [2024-10-11 13:49:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:49:05,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:49:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:05,498 INFO L225 Difference]: With dead ends: 259 [2024-10-11 13:49:05,498 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 13:49:05,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:49:05,499 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:05,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 305 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:49:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 13:49:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2024-10-11 13:49:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:49:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 147 transitions. [2024-10-11 13:49:05,527 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 147 transitions. Word has length 98 [2024-10-11 13:49:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:05,528 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 147 transitions. [2024-10-11 13:49:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 147 transitions. [2024-10-11 13:49:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:49:05,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:05,533 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:05,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:05,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:05,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:05,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash 447407377, now seen corresponding path program 1 times [2024-10-11 13:49:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:05,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433620235] [2024-10-11 13:49:05,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:05,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:05,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:05,736 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:05,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:05,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:49:05,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:05,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:49:05,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-10-11 13:49:05,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:05,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 47 [2024-10-11 13:49:06,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:06,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 50 [2024-10-11 13:49:06,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:06,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 29 [2024-10-11 13:49:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:49:06,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:06,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:06,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433620235] [2024-10-11 13:49:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433620235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:49:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340744742] [2024-10-11 13:49:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:06,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:49:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:06,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:49:06,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:49:06,127 INFO L87 Difference]: Start difference. First operand 110 states and 147 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:07,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:07,125 INFO L93 Difference]: Finished difference Result 403 states and 534 transitions. [2024-10-11 13:49:07,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:49:07,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:49:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:07,128 INFO L225 Difference]: With dead ends: 403 [2024-10-11 13:49:07,128 INFO L226 Difference]: Without dead ends: 294 [2024-10-11 13:49:07,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:49:07,129 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 275 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:07,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 684 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:49:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-11 13:49:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 176. [2024-10-11 13:49:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.3248407643312101) internal successors, (208), 158 states have internal predecessors, (208), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:49:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 236 transitions. [2024-10-11 13:49:07,147 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 236 transitions. Word has length 98 [2024-10-11 13:49:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:07,148 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 236 transitions. [2024-10-11 13:49:07,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 236 transitions. [2024-10-11 13:49:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:49:07,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:07,150 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:07,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:07,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:07,351 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:07,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1526810984, now seen corresponding path program 1 times [2024-10-11 13:49:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018512605] [2024-10-11 13:49:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:07,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:07,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:07,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:07,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:07,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:49:07,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:07,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-11 13:49:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:49:07,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:07,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018512605] [2024-10-11 13:49:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018512605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:07,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:07,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:49:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21598199] [2024-10-11 13:49:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:07,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:49:07,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:49:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:49:07,524 INFO L87 Difference]: Start difference. First operand 176 states and 236 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:07,563 INFO L93 Difference]: Finished difference Result 343 states and 459 transitions. [2024-10-11 13:49:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:49:07,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:49:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:07,566 INFO L225 Difference]: With dead ends: 343 [2024-10-11 13:49:07,566 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 13:49:07,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:49:07,568 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 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-10-11 13:49:07,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:49:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 13:49:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-11 13:49:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 149 states have (on average 1.3020134228187918) internal successors, (194), 150 states have internal predecessors, (194), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:49:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 222 transitions. [2024-10-11 13:49:07,594 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 222 transitions. Word has length 98 [2024-10-11 13:49:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:07,596 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 222 transitions. [2024-10-11 13:49:07,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2024-10-11 13:49:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:49:07,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:07,598 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:07,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:49:07,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:07,799 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:07,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash -370241073, now seen corresponding path program 1 times [2024-10-11 13:49:07,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:07,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662974778] [2024-10-11 13:49:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:07,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:07,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:07,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:07,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:07,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:49:07,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:08,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:49:08,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-10-11 13:49:08,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:08,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 27 [2024-10-11 13:49:08,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:08,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 24 [2024-10-11 13:49:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:49:08,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:08,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:08,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662974778] [2024-10-11 13:49:08,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662974778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:08,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:08,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:49:08,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404187381] [2024-10-11 13:49:08,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:08,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:49:08,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:08,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:49:08,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:49:08,100 INFO L87 Difference]: Start difference. First operand 168 states and 222 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:08,789 INFO L93 Difference]: Finished difference Result 426 states and 561 transitions. [2024-10-11 13:49:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:49:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:49:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:08,791 INFO L225 Difference]: With dead ends: 426 [2024-10-11 13:49:08,791 INFO L226 Difference]: Without dead ends: 259 [2024-10-11 13:49:08,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:49:08,792 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 98 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:08,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 786 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:49:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-11 13:49:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 181. [2024-10-11 13:49:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 163 states have internal predecessors, (209), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:49:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 237 transitions. [2024-10-11 13:49:08,808 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 237 transitions. Word has length 98 [2024-10-11 13:49:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:08,809 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 237 transitions. [2024-10-11 13:49:08,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 237 transitions. [2024-10-11 13:49:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:49:08,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:08,810 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:08,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:49:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:09,011 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:09,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1501797076, now seen corresponding path program 1 times [2024-10-11 13:49:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40708676] [2024-10-11 13:49:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:09,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:09,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:09,014 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:09,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:49:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:09,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:49:09,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:09,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-11 13:49:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:49:09,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:09,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:09,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40708676] [2024-10-11 13:49:09,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40708676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:09,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:09,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:49:09,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247514286] [2024-10-11 13:49:09,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:09,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:49:09,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:09,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:49:09,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:49:09,180 INFO L87 Difference]: Start difference. First operand 181 states and 237 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:09,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:09,221 INFO L93 Difference]: Finished difference Result 337 states and 440 transitions. [2024-10-11 13:49:09,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:49:09,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:49:09,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:09,224 INFO L225 Difference]: With dead ends: 337 [2024-10-11 13:49:09,224 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 13:49:09,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:49:09,227 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 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-10-11 13:49:09,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:49:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 13:49:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-11 13:49:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 138 states have (on average 1.2681159420289856) internal successors, (175), 139 states have internal predecessors, (175), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:49:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2024-10-11 13:49:09,241 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 98 [2024-10-11 13:49:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:09,241 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2024-10-11 13:49:09,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2024-10-11 13:49:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:49:09,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:09,246 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:09,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:49:09,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:09,446 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:09,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:09,447 INFO L85 PathProgramCache]: Analyzing trace with hash 389938296, now seen corresponding path program 1 times [2024-10-11 13:49:09,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:09,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282484042] [2024-10-11 13:49:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:09,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:09,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:09,448 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:09,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (13)] Waiting until timeout for monitored process [2024-10-11 13:49:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:09,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 13:49:09,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:09,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:49:09,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-10-11 13:49:10,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:10,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-10-11 13:49:10,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:10,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70 [2024-10-11 13:49:10,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:10,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 83 [2024-10-11 13:49:11,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110 [2024-10-11 13:49:11,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:11,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 192 treesize of output 146 [2024-10-11 13:49:11,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:11,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 188 treesize of output 137 [2024-10-11 13:49:11,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:11,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 194 treesize of output 148 [2024-10-11 13:49:11,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:11,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 244 treesize of output 88 [2024-10-11 13:49:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 13:49:12,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:12,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:12,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282484042] [2024-10-11 13:49:12,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282484042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:12,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:12,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 13:49:12,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709466109] [2024-10-11 13:49:12,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:12,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:49:12,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:12,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:49:12,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:49:12,086 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-11 13:49:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:15,272 INFO L93 Difference]: Finished difference Result 465 states and 593 transitions. [2024-10-11 13:49:15,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 13:49:15,275 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 100 [2024-10-11 13:49:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:15,278 INFO L225 Difference]: With dead ends: 465 [2024-10-11 13:49:15,278 INFO L226 Difference]: Without dead ends: 309 [2024-10-11 13:49:15,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:49:15,279 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 388 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:15,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 603 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 13:49:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-11 13:49:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 298. [2024-10-11 13:49:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.25) internal successors, (325), 263 states have internal predecessors, (325), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:49:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 379 transitions. [2024-10-11 13:49:15,308 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 379 transitions. Word has length 100 [2024-10-11 13:49:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:15,309 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 379 transitions. [2024-10-11 13:49:15,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-11 13:49:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 379 transitions. [2024-10-11 13:49:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:49:15,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:15,311 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:15,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (13)] Ended with exit code 0 [2024-10-11 13:49:15,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:15,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:15,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1091858256, now seen corresponding path program 1 times [2024-10-11 13:49:15,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:15,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468623505] [2024-10-11 13:49:15,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:15,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:15,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:15,516 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:15,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (14)] Waiting until timeout for monitored process [2024-10-11 13:49:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:15,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:49:15,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:15,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 43 [2024-10-11 13:49:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-11 13:49:15,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:49:15,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 25 [2024-10-11 13:49:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:49:15,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468623505] [2024-10-11 13:49:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468623505] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:49:15,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:49:15,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-11 13:49:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688738680] [2024-10-11 13:49:15,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:49:15,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:49:15,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:49:15,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:49:15,979 INFO L87 Difference]: Start difference. First operand 298 states and 379 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-11 13:49:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:16,609 INFO L93 Difference]: Finished difference Result 631 states and 797 transitions. [2024-10-11 13:49:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:49:16,610 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 102 [2024-10-11 13:49:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:16,613 INFO L225 Difference]: With dead ends: 631 [2024-10-11 13:49:16,614 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 13:49:16,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:49:16,615 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 112 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:16,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 527 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:49:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 13:49:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 294. [2024-10-11 13:49:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.23828125) internal successors, (317), 259 states have internal predecessors, (317), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:49:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 371 transitions. [2024-10-11 13:49:16,650 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 371 transitions. Word has length 102 [2024-10-11 13:49:16,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:16,651 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 371 transitions. [2024-10-11 13:49:16,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-11 13:49:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 371 transitions. [2024-10-11 13:49:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:49:16,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:16,653 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:16,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (14)] Ended with exit code 0 [2024-10-11 13:49:16,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:16,854 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:16,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1493130011, now seen corresponding path program 1 times [2024-10-11 13:49:16,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:16,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363348020] [2024-10-11 13:49:16,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:16,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:16,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:16,856 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:16,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (15)] Waiting until timeout for monitored process [2024-10-11 13:49:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:17,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 13:49:17,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:17,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:49:17,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-10-11 13:49:17,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:17,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-10-11 13:49:17,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:17,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70 [2024-10-11 13:49:18,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:18,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 83 [2024-10-11 13:49:18,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110 [2024-10-11 13:49:19,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:19,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 192 treesize of output 146 [2024-10-11 13:49:19,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:19,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 188 treesize of output 137 [2024-10-11 13:49:19,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:19,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 194 treesize of output 148 [2024-10-11 13:49:20,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 175 [2024-10-11 13:49:20,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:49:20,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:20,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 175 treesize of output 241 [2024-10-11 13:49:20,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:49:20,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:49:20,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 47 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 99 [2024-10-11 13:49:22,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:22,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 475 treesize of output 181 [2024-10-11 13:49:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 13:49:22,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:22,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:22,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363348020] [2024-10-11 13:49:22,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363348020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:22,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:22,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-11 13:49:22,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188379038] [2024-10-11 13:49:22,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:22,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 13:49:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:22,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 13:49:22,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:49:22,277 INFO L87 Difference]: Start difference. First operand 294 states and 371 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-11 13:49:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:25,951 INFO L93 Difference]: Finished difference Result 593 states and 745 transitions. [2024-10-11 13:49:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 13:49:25,951 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 102 [2024-10-11 13:49:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:25,953 INFO L225 Difference]: With dead ends: 593 [2024-10-11 13:49:25,953 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 13:49:25,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:49:25,955 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 446 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:25,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 780 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 13:49:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 13:49:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2024-10-11 13:49:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.23046875) internal successors, (315), 259 states have internal predecessors, (315), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:49:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 369 transitions. [2024-10-11 13:49:25,985 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 369 transitions. Word has length 102 [2024-10-11 13:49:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:25,986 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 369 transitions. [2024-10-11 13:49:25,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-11 13:49:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 369 transitions. [2024-10-11 13:49:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:49:25,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:25,988 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:25,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (15)] Ended with exit code 0 [2024-10-11 13:49:26,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:26,188 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:26,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1627143517, now seen corresponding path program 1 times [2024-10-11 13:49:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:26,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108335226] [2024-10-11 13:49:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:26,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:26,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:26,191 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:26,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (16)] Waiting until timeout for monitored process [2024-10-11 13:49:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:26,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 13:49:26,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:26,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:49:26,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-11 13:49:26,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-11 13:49:26,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-11 13:49:26,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:26,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-11 13:49:26,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:26,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-11 13:49:26,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:26,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-10-11 13:49:26,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:26,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-10-11 13:49:26,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:26,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 73 [2024-10-11 13:49:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 152 proven. 27 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-11 13:49:27,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:49:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:49:27,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108335226] [2024-10-11 13:49:27,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108335226] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:49:27,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:49:27,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2024-10-11 13:49:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037358274] [2024-10-11 13:49:27,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:49:27,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 13:49:27,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:27,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 13:49:27,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:49:27,498 INFO L87 Difference]: Start difference. First operand 294 states and 369 transitions. Second operand has 23 states, 21 states have (on average 4.809523809523809) internal successors, (101), 23 states have internal predecessors, (101), 7 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21) [2024-10-11 13:49:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:29,873 INFO L93 Difference]: Finished difference Result 727 states and 884 transitions. [2024-10-11 13:49:29,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-11 13:49:29,874 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.809523809523809) internal successors, (101), 23 states have internal predecessors, (101), 7 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21) Word has length 102 [2024-10-11 13:49:29,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:29,877 INFO L225 Difference]: With dead ends: 727 [2024-10-11 13:49:29,877 INFO L226 Difference]: Without dead ends: 434 [2024-10-11 13:49:29,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=559, Invalid=2197, Unknown=0, NotChecked=0, Total=2756 [2024-10-11 13:49:29,878 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:29,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 526 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 13:49:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-11 13:49:29,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 172. [2024-10-11 13:49:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 141 states have (on average 1.1418439716312057) internal successors, (161), 141 states have internal predecessors, (161), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:49:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2024-10-11 13:49:29,904 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 102 [2024-10-11 13:49:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:29,904 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2024-10-11 13:49:29,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.809523809523809) internal successors, (101), 23 states have internal predecessors, (101), 7 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21) [2024-10-11 13:49:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2024-10-11 13:49:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:49:29,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:29,906 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:29,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (16)] Ended with exit code 0 [2024-10-11 13:49:30,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:30,107 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:30,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1466989595, now seen corresponding path program 1 times [2024-10-11 13:49:30,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:30,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631993565] [2024-10-11 13:49:30,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:30,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:30,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:30,109 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:30,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (17)] Waiting until timeout for monitored process [2024-10-11 13:49:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:30,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 13:49:30,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:30,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:49:30,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-11 13:49:30,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-11 13:49:30,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-11 13:49:30,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-10-11 13:49:30,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 71 [2024-10-11 13:49:31,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:31,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 107 [2024-10-11 13:49:31,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:31,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 98 [2024-10-11 13:49:31,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:31,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 197 treesize of output 71 [2024-10-11 13:49:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-11 13:49:31,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:31,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:31,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631993565] [2024-10-11 13:49:31,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631993565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:31,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:31,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:49:31,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767415238] [2024-10-11 13:49:31,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:31,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:49:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:49:31,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:49:31,306 INFO L87 Difference]: Start difference. First operand 172 states and 201 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 13:49:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:33,283 INFO L93 Difference]: Finished difference Result 372 states and 439 transitions. [2024-10-11 13:49:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:49:33,283 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2024-10-11 13:49:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:33,285 INFO L225 Difference]: With dead ends: 372 [2024-10-11 13:49:33,285 INFO L226 Difference]: Without dead ends: 201 [2024-10-11 13:49:33,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:49:33,286 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 274 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:33,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 408 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 13:49:33,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-11 13:49:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 169. [2024-10-11 13:49:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:49:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2024-10-11 13:49:33,317 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 102 [2024-10-11 13:49:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:33,317 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2024-10-11 13:49:33,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 13:49:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2024-10-11 13:49:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:49:33,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:33,318 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:33,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (17)] Forceful destruction successful, exit code 0 [2024-10-11 13:49:33,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:33,519 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:33,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash -97164558, now seen corresponding path program 1 times [2024-10-11 13:49:33,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:33,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683776588] [2024-10-11 13:49:33,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:33,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:33,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:33,521 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:33,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (18)] Waiting until timeout for monitored process [2024-10-11 13:49:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:33,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 13:49:33,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:33,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:49:33,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2024-10-11 13:49:33,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:33,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 34 [2024-10-11 13:49:34,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:34,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-10-11 13:49:34,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:34,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 57 [2024-10-11 13:49:34,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2024-10-11 13:49:34,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:34,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 180 treesize of output 131 [2024-10-11 13:49:34,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:34,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 176 treesize of output 122 [2024-10-11 13:49:35,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:35,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 182 treesize of output 133 [2024-10-11 13:49:35,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:35,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 192 treesize of output 137 [2024-10-11 13:49:35,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:35,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 227 treesize of output 83 [2024-10-11 13:49:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 158 proven. 24 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 13:49:35,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:49:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:49:36,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:36,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683776588] [2024-10-11 13:49:36,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683776588] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:49:36,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:49:36,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 23 [2024-10-11 13:49:36,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263056867] [2024-10-11 13:49:36,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:36,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:49:36,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:49:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:49:36,209 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:37,379 INFO L93 Difference]: Finished difference Result 407 states and 481 transitions. [2024-10-11 13:49:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:49:37,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-11 13:49:37,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:37,382 INFO L225 Difference]: With dead ends: 407 [2024-10-11 13:49:37,382 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 13:49:37,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-10-11 13:49:37,383 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 62 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:37,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 419 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:49:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 13:49:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 196. [2024-10-11 13:49:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 165 states have (on average 1.1454545454545455) internal successors, (189), 165 states have internal predecessors, (189), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:49:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2024-10-11 13:49:37,411 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 102 [2024-10-11 13:49:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:37,412 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2024-10-11 13:49:37,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2024-10-11 13:49:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:49:37,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:37,413 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:37,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (18)] Ended with exit code 0 [2024-10-11 13:49:37,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:37,614 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:37,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:37,614 INFO L85 PathProgramCache]: Analyzing trace with hash 582893812, now seen corresponding path program 1 times [2024-10-11 13:49:37,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:37,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023786146] [2024-10-11 13:49:37,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:37,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:37,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:37,618 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:37,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (19)] Waiting until timeout for monitored process [2024-10-11 13:49:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:37,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:49:37,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:37,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:49:37,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 13:49:37,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-11 13:49:37,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:37,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-11 13:49:38,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:38,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-10-11 13:49:38,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2024-10-11 13:49:38,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:38,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 100 treesize of output 87 [2024-10-11 13:49:38,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:38,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 87 [2024-10-11 13:49:38,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:38,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 102 treesize of output 107 [2024-10-11 13:49:38,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:38,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 117 treesize of output 110 [2024-10-11 13:49:38,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:38,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 125 treesize of output 47 [2024-10-11 13:49:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 13:49:38,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:38,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:38,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023786146] [2024-10-11 13:49:38,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023786146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:38,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:38,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:49:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514766362] [2024-10-11 13:49:38,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:38,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:49:38,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:38,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:49:38,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:49:38,879 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 13:49:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:40,275 INFO L93 Difference]: Finished difference Result 461 states and 547 transitions. [2024-10-11 13:49:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:49:40,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2024-10-11 13:49:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:40,277 INFO L225 Difference]: With dead ends: 461 [2024-10-11 13:49:40,277 INFO L226 Difference]: Without dead ends: 266 [2024-10-11 13:49:40,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:49:40,278 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 267 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:40,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 207 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 377 Invalid, 2 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 13:49:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-11 13:49:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 181. [2024-10-11 13:49:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 150 states have (on average 1.14) internal successors, (171), 150 states have internal predecessors, (171), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:49:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2024-10-11 13:49:40,307 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 102 [2024-10-11 13:49:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:40,307 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2024-10-11 13:49:40,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 13:49:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2024-10-11 13:49:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:49:40,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:40,308 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:40,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (19)] Forceful destruction successful, exit code 0 [2024-10-11 13:49:40,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:40,509 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:40,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1289038836, now seen corresponding path program 1 times [2024-10-11 13:49:40,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:40,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440259123] [2024-10-11 13:49:40,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:40,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:40,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:40,511 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:40,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (20)] Waiting until timeout for monitored process [2024-10-11 13:49:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:40,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 13:49:40,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:40,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:49:40,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 13:49:40,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-11 13:49:40,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-11 13:49:40,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:40,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-11 13:49:41,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2024-10-11 13:49:41,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88 [2024-10-11 13:49:41,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:41,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 126 treesize of output 108 [2024-10-11 13:49:41,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:41,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 183 treesize of output 134 [2024-10-11 13:49:41,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:41,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 138 [2024-10-11 13:49:42,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:42,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 201 treesize of output 75 [2024-10-11 13:49:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 13:49:42,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:42,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:42,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440259123] [2024-10-11 13:49:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440259123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:42,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:42,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:49:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182469701] [2024-10-11 13:49:42,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:42,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:49:42,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:49:42,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:49:42,221 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 13:49:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:43,939 INFO L93 Difference]: Finished difference Result 431 states and 512 transitions. [2024-10-11 13:49:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:49:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2024-10-11 13:49:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:43,941 INFO L225 Difference]: With dead ends: 431 [2024-10-11 13:49:43,941 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 13:49:43,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:49:43,942 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 420 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:43,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 366 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 13:49:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 13:49:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 200. [2024-10-11 13:49:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 169 states have (on average 1.1420118343195267) internal successors, (193), 169 states have internal predecessors, (193), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:49:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2024-10-11 13:49:43,986 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 102 [2024-10-11 13:49:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:43,987 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2024-10-11 13:49:43,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 13:49:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2024-10-11 13:49:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:49:43,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:43,988 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:43,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (20)] Forceful destruction successful, exit code 0 [2024-10-11 13:49:44,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:44,189 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:44,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1969097206, now seen corresponding path program 1 times [2024-10-11 13:49:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:44,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658235456] [2024-10-11 13:49:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:44,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:44,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:44,191 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:44,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (21)] Waiting until timeout for monitored process [2024-10-11 13:49:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:44,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:49:44,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:44,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:49:44,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-10-11 13:49:44,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:44,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2024-10-11 13:49:44,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:44,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2024-10-11 13:49:44,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:44,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 26 [2024-10-11 13:49:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:49:44,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:44,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:44,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658235456] [2024-10-11 13:49:44,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658235456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:44,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:44,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:49:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607338699] [2024-10-11 13:49:44,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:44,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:49:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:49:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:49:44,729 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:46,030 INFO L93 Difference]: Finished difference Result 612 states and 717 transitions. [2024-10-11 13:49:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:49:46,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-11 13:49:46,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:46,033 INFO L225 Difference]: With dead ends: 612 [2024-10-11 13:49:46,033 INFO L226 Difference]: Without dead ends: 413 [2024-10-11 13:49:46,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:49:46,034 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 268 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:46,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1055 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:49:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-11 13:49:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 200. [2024-10-11 13:49:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 169 states have (on average 1.1420118343195267) internal successors, (193), 169 states have internal predecessors, (193), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:49:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2024-10-11 13:49:46,079 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 102 [2024-10-11 13:49:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:46,080 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2024-10-11 13:49:46,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:49:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2024-10-11 13:49:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:49:46,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:46,081 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:46,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (21)] Forceful destruction successful, exit code 0 [2024-10-11 13:49:46,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:46,281 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:46,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:46,282 INFO L85 PathProgramCache]: Analyzing trace with hash -762328332, now seen corresponding path program 1 times [2024-10-11 13:49:46,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:46,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003579736] [2024-10-11 13:49:46,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:46,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:46,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:46,283 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:46,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (22)] Waiting until timeout for monitored process [2024-10-11 13:49:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:46,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 13:49:46,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:46,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:49:46,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 13:49:46,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-11 13:49:46,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:46,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-11 13:49:46,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:46,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-11 13:49:46,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2024-10-11 13:49:46,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88 [2024-10-11 13:49:47,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:47,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 126 treesize of output 108 [2024-10-11 13:49:47,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:47,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 152 treesize of output 112 [2024-10-11 13:49:47,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:47,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 152 treesize of output 112 [2024-10-11 13:49:47,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:47,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 160 treesize of output 58 [2024-10-11 13:49:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 13:49:47,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:49:47,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:47,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003579736] [2024-10-11 13:49:47,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003579736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:49:47,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:49:47,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:49:47,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269613446] [2024-10-11 13:49:47,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:49:47,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:49:47,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:47,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:49:47,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:49:47,705 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 13:49:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:50,181 INFO L93 Difference]: Finished difference Result 450 states and 531 transitions. [2024-10-11 13:49:50,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:49:50,182 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2024-10-11 13:49:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:50,184 INFO L225 Difference]: With dead ends: 450 [2024-10-11 13:49:50,184 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 13:49:50,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:49:50,185 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 324 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:50,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 534 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 13:49:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 13:49:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 178. [2024-10-11 13:49:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 147 states have (on average 1.129251700680272) internal successors, (166), 147 states have internal predecessors, (166), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:49:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2024-10-11 13:49:50,228 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 102 [2024-10-11 13:49:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:50,229 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2024-10-11 13:49:50,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 13:49:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2024-10-11 13:49:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 13:49:50,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:50,230 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:50,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (22)] Ended with exit code 0 [2024-10-11 13:49:50,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:50,431 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:49:50,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:49:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash 462998076, now seen corresponding path program 1 times [2024-10-11 13:49:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:49:50,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461740980] [2024-10-11 13:49:50,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:49:50,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:49:50,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:49:50,433 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:49:50,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (23)] Waiting until timeout for monitored process [2024-10-11 13:49:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:49:50,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 13:49:50,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:49:50,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:49:50,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-11 13:49:50,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:50,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-11 13:49:50,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:50,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-11 13:49:50,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:50,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2024-10-11 13:49:50,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:50,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 55 [2024-10-11 13:49:50,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:50,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 55 [2024-10-11 13:49:50,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:50,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 75 [2024-10-11 13:49:51,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 76 [2024-10-11 13:49:51,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:49:51,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:51,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 152 [2024-10-11 13:49:51,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2024-10-11 13:49:51,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:49:51,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 169 treesize of output 73 [2024-10-11 13:49:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-11 13:49:51,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:49:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:49:51,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:49:51,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461740980] [2024-10-11 13:49:51,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461740980] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:49:51,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:49:51,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2024-10-11 13:49:51,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968316982] [2024-10-11 13:49:51,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:49:51,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:49:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:49:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:49:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:49:51,896 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 5 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-10-11 13:49:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:49:52,769 INFO L93 Difference]: Finished difference Result 437 states and 507 transitions. [2024-10-11 13:49:52,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:49:52,770 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 5 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 106 [2024-10-11 13:49:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:49:52,772 INFO L225 Difference]: With dead ends: 437 [2024-10-11 13:49:52,772 INFO L226 Difference]: Without dead ends: 260 [2024-10-11 13:49:52,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:49:52,773 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 219 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:49:52,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 233 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:49:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-11 13:49:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 178. [2024-10-11 13:49:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 147 states have (on average 1.1224489795918366) internal successors, (165), 147 states have internal predecessors, (165), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:49:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2024-10-11 13:49:52,824 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 106 [2024-10-11 13:49:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:49:52,824 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2024-10-11 13:49:52,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 5 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-10-11 13:49:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2024-10-11 13:49:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 13:49:52,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:49:52,826 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:49:52,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (23)] Ended with exit code 0