./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-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-8.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64fa20811e3d6b4f48d530fd12c5b3e1f5523460c92f2bd0d2e9efe97c916004 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:52:32,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:52:32,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:52:32,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:52:32,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:52:32,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:52:32,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:52:32,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:52:32,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:52:32,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:52:32,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:52:32,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:52:32,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:52:32,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:52:32,682 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:52:32,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:52:32,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:52:32,683 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:52:32,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:52:32,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:52:32,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:52:32,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:52:32,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:52:32,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:52:32,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:52:32,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:52:32,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:52:32,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:52:32,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:52:32,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:52:32,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:52:32,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:52:32,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:32,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:52:32,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:52:32,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:52:32,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:52:32,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:52:32,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:52:32,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:52:32,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:52:32,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:52:32,695 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64fa20811e3d6b4f48d530fd12c5b3e1f5523460c92f2bd0d2e9efe97c916004 [2024-10-24 11:52:32,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:52:32,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:52:32,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:52:32,979 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:52:32,980 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:52:32,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-8.i [2024-10-24 11:52:34,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:52:34,642 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:52:34,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-8.i [2024-10-24 11:52:34,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc8d2e87/5936497ed46a41ed9dc000377553ad07/FLAGe3c7f6c4b [2024-10-24 11:52:35,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc8d2e87/5936497ed46a41ed9dc000377553ad07 [2024-10-24 11:52:35,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:52:35,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:52:35,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:35,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:52:35,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:52:35,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7a90ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35, skipping insertion in model container [2024-10-24 11:52:35,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:52:35,250 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-8.i[915,928] [2024-10-24 11:52:35,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:35,330 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:52:35,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-8.i[915,928] [2024-10-24 11:52:35,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:35,412 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:52:35,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35 WrapperNode [2024-10-24 11:52:35,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:35,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:35,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:52:35,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:52:35,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,484 INFO L138 Inliner]: procedures = 29, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2024-10-24 11:52:35,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:35,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:52:35,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:52:35,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:52:35,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,522 INFO L175 MemorySlicer]: Split 126 memory accesses to 2 slices as follows [2, 124]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2024-10-24 11:52:35,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:52:35,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:52:35,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:52:35,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:52:35,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (1/1) ... [2024-10-24 11:52:35,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:52:35,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:52:35,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:52:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:52:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:52:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:52:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:52:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:52:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:52:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:52:35,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:52:35,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:52:35,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:52:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:52:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:52:35,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:52:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:52:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:52:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:52:35,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:52:35,778 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:52:35,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:52:36,277 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-24 11:52:36,278 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:52:36,315 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:52:36,315 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:52:36,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:36 BoogieIcfgContainer [2024-10-24 11:52:36,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:52:36,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:52:36,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:52:36,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:52:36,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:52:35" (1/3) ... [2024-10-24 11:52:36,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dcaa2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:36, skipping insertion in model container [2024-10-24 11:52:36,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:35" (2/3) ... [2024-10-24 11:52:36,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dcaa2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:36, skipping insertion in model container [2024-10-24 11:52:36,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:36" (3/3) ... [2024-10-24 11:52:36,327 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-8.i [2024-10-24 11:52:36,344 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:52:36,345 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:52:36,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:52:36,479 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;@233ecf41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:52:36,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:52:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:52:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:52:36,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:36,493 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:36,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:36,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2143100842, now seen corresponding path program 1 times [2024-10-24 11:52:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:36,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198693191] [2024-10-24 11:52:36,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:36,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198693191] [2024-10-24 11:52:36,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198693191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:36,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:36,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:52:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766525833] [2024-10-24 11:52:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:36,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:52:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:36,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:52:36,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:52:36,934 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:36,980 INFO L93 Difference]: Finished difference Result 183 states and 288 transitions. [2024-10-24 11:52:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:52:36,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-10-24 11:52:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:36,994 INFO L225 Difference]: With dead ends: 183 [2024-10-24 11:52:36,994 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:52:36,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:52:37,004 INFO L432 NwaCegarLoop]: 129 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, 129 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-24 11:52:37,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:52:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 11:52:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:52:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-24 11:52:37,048 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 118 [2024-10-24 11:52:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:37,049 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-24 11:52:37,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-24 11:52:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:52:37,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:37,052 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:37,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:52:37,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:37,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1017374914, now seen corresponding path program 1 times [2024-10-24 11:52:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:37,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082664615] [2024-10-24 11:52:37,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:37,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:37,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082664615] [2024-10-24 11:52:37,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082664615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:37,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:37,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:37,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068543707] [2024-10-24 11:52:37,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:37,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:37,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:37,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:37,442 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:52:37,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:37,511 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-10-24 11:52:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:37,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-24 11:52:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:37,514 INFO L225 Difference]: With dead ends: 184 [2024-10-24 11:52:37,514 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 11:52:37,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-24 11:52:37,519 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:37,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 371 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 11:52:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-10-24 11:52:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:52:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-10-24 11:52:37,537 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 118 [2024-10-24 11:52:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:37,541 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-10-24 11:52:37,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:52:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-10-24 11:52:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:52:37,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:37,545 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:37,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:52:37,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:37,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:37,546 INFO L85 PathProgramCache]: Analyzing trace with hash 208028288, now seen corresponding path program 1 times [2024-10-24 11:52:37,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:37,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568959892] [2024-10-24 11:52:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:37,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:37,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568959892] [2024-10-24 11:52:37,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568959892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:37,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:37,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415114352] [2024-10-24 11:52:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:37,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:37,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:37,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:37,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:37,830 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:52:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:37,887 INFO L93 Difference]: Finished difference Result 188 states and 273 transitions. [2024-10-24 11:52:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:37,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-24 11:52:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:37,893 INFO L225 Difference]: With dead ends: 188 [2024-10-24 11:52:37,894 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 11:52:37,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-24 11:52:37,898 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:37,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 372 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 11:52:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-24 11:52:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:52:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-10-24 11:52:37,911 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 118 [2024-10-24 11:52:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:37,911 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-10-24 11:52:37,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:52:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-10-24 11:52:37,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:52:37,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:37,913 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:37,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:52:37,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:37,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash 265286590, now seen corresponding path program 1 times [2024-10-24 11:52:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:37,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547089314] [2024-10-24 11:52:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:37,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:38,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547089314] [2024-10-24 11:52:38,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547089314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:38,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:38,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:38,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987564463] [2024-10-24 11:52:38,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:38,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:38,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:38,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:38,107 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:52:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:38,160 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-10-24 11:52:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:38,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-24 11:52:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:38,163 INFO L225 Difference]: With dead ends: 192 [2024-10-24 11:52:38,163 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 11:52:38,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-24 11:52:38,165 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:38,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 11:52:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-24 11:52:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:52:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-10-24 11:52:38,172 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 118 [2024-10-24 11:52:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:38,173 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-10-24 11:52:38,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:52:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-10-24 11:52:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:52:38,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:38,175 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:38,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:52:38,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:38,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash 265346172, now seen corresponding path program 1 times [2024-10-24 11:52:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:38,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053492101] [2024-10-24 11:52:38,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053492101] [2024-10-24 11:52:38,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053492101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:38,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:38,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:38,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809190493] [2024-10-24 11:52:38,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:38,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:52:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:38,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:52:38,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:52:38,940 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:39,229 INFO L93 Difference]: Finished difference Result 193 states and 277 transitions. [2024-10-24 11:52:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:52:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-10-24 11:52:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:39,231 INFO L225 Difference]: With dead ends: 193 [2024-10-24 11:52:39,231 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 11:52:39,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:52:39,233 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 113 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:39,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 203 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:52:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 11:52:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-24 11:52:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:52:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-10-24 11:52:39,247 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 118 [2024-10-24 11:52:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:39,247 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-10-24 11:52:39,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-10-24 11:52:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:52:39,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:39,250 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:39,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:52:39,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:39,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1728798534, now seen corresponding path program 1 times [2024-10-24 11:52:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:39,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417012329] [2024-10-24 11:52:39,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:40,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:40,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417012329] [2024-10-24 11:52:40,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417012329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:40,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:40,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:52:40,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182657189] [2024-10-24 11:52:40,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:40,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:40,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:40,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:40,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:40,889 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:41,219 INFO L93 Difference]: Finished difference Result 245 states and 344 transitions. [2024-10-24 11:52:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:52:41,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-10-24 11:52:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:41,222 INFO L225 Difference]: With dead ends: 245 [2024-10-24 11:52:41,224 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 11:52:41,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:52:41,225 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 57 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:41,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 513 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:52:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 11:52:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-10-24 11:52:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.3333333333333333) internal successors, (164), 124 states have internal predecessors, (164), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:52:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 204 transitions. [2024-10-24 11:52:41,250 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 204 transitions. Word has length 118 [2024-10-24 11:52:41,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:41,250 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 204 transitions. [2024-10-24 11:52:41,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 204 transitions. [2024-10-24 11:52:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:52:41,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:41,252 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:41,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:52:41,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:41,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash -880932673, now seen corresponding path program 1 times [2024-10-24 11:52:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:41,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036863255] [2024-10-24 11:52:41,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:41,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:42,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:42,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036863255] [2024-10-24 11:52:42,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036863255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:42,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:42,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:52:42,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275057882] [2024-10-24 11:52:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:42,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:52:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:52:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:52:42,152 INFO L87 Difference]: Start difference. First operand 146 states and 204 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:52:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:42,819 INFO L93 Difference]: Finished difference Result 334 states and 468 transitions. [2024-10-24 11:52:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:52:42,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-24 11:52:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:42,821 INFO L225 Difference]: With dead ends: 334 [2024-10-24 11:52:42,821 INFO L226 Difference]: Without dead ends: 189 [2024-10-24 11:52:42,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:52:42,822 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 297 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:42,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 429 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:52:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-24 11:52:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2024-10-24 11:52:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 155 states have internal predecessors, (206), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:52:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2024-10-24 11:52:42,861 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 120 [2024-10-24 11:52:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:42,862 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2024-10-24 11:52:42,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:52:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2024-10-24 11:52:42,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:52:42,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:42,864 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:42,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:52:42,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:42,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1358309407, now seen corresponding path program 1 times [2024-10-24 11:52:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624387869] [2024-10-24 11:52:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:43,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:43,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624387869] [2024-10-24 11:52:43,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624387869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:43,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:43,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:52:43,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389228231] [2024-10-24 11:52:43,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:43,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:52:43,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:43,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:52:43,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:52:43,924 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:44,666 INFO L93 Difference]: Finished difference Result 368 states and 516 transitions. [2024-10-24 11:52:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:52:44,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-24 11:52:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:44,671 INFO L225 Difference]: With dead ends: 368 [2024-10-24 11:52:44,671 INFO L226 Difference]: Without dead ends: 183 [2024-10-24 11:52:44,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:52:44,672 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 310 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:44,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 289 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:52:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-24 11:52:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-10-24 11:52:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 148 states have (on average 1.3243243243243243) internal successors, (196), 149 states have internal predecessors, (196), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:52:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 252 transitions. [2024-10-24 11:52:44,705 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 252 transitions. Word has length 120 [2024-10-24 11:52:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:44,706 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 252 transitions. [2024-10-24 11:52:44,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2024-10-24 11:52:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:52:44,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:44,708 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:44,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:52:44,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:44,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:44,709 INFO L85 PathProgramCache]: Analyzing trace with hash -985015800, now seen corresponding path program 1 times [2024-10-24 11:52:44,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:44,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758936118] [2024-10-24 11:52:44,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:45,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:45,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758936118] [2024-10-24 11:52:45,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758936118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:46,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:46,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:52:46,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240997875] [2024-10-24 11:52:46,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:46,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:52:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:52:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:52:46,002 INFO L87 Difference]: Start difference. First operand 180 states and 252 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:47,038 INFO L93 Difference]: Finished difference Result 425 states and 594 transitions. [2024-10-24 11:52:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:52:47,039 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-24 11:52:47,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:47,041 INFO L225 Difference]: With dead ends: 425 [2024-10-24 11:52:47,041 INFO L226 Difference]: Without dead ends: 246 [2024-10-24 11:52:47,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:52:47,042 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 256 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:47,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1056 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:52:47,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-24 11:52:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 186. [2024-10-24 11:52:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 154 states have (on average 1.3116883116883118) internal successors, (202), 155 states have internal predecessors, (202), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:52:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 258 transitions. [2024-10-24 11:52:47,080 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 258 transitions. Word has length 120 [2024-10-24 11:52:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:47,080 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 258 transitions. [2024-10-24 11:52:47,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 258 transitions. [2024-10-24 11:52:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:52:47,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:47,083 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:47,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:52:47,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:47,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:47,084 INFO L85 PathProgramCache]: Analyzing trace with hash 113615588, now seen corresponding path program 1 times [2024-10-24 11:52:47,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:47,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306681647] [2024-10-24 11:52:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:47,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:47,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:47,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306681647] [2024-10-24 11:52:47,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306681647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:47,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:47,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:52:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143736729] [2024-10-24 11:52:47,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:47,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:52:47,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:52:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:52:47,632 INFO L87 Difference]: Start difference. First operand 186 states and 258 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:52:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:48,056 INFO L93 Difference]: Finished difference Result 531 states and 740 transitions. [2024-10-24 11:52:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:52:48,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-10-24 11:52:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:48,062 INFO L225 Difference]: With dead ends: 531 [2024-10-24 11:52:48,063 INFO L226 Difference]: Without dead ends: 346 [2024-10-24 11:52:48,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:52:48,065 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 116 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:48,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 568 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:52:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-24 11:52:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 193. [2024-10-24 11:52:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 161 states have (on average 1.3043478260869565) internal successors, (210), 162 states have internal predecessors, (210), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:52:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 266 transitions. [2024-10-24 11:52:48,103 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 266 transitions. Word has length 122 [2024-10-24 11:52:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:48,104 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 266 transitions. [2024-10-24 11:52:48,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:52:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 266 transitions. [2024-10-24 11:52:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:52:48,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:48,105 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:48,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:52:48,106 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:48,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 124124789, now seen corresponding path program 1 times [2024-10-24 11:52:48,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:48,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029883415] [2024-10-24 11:52:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:48,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:49,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:49,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029883415] [2024-10-24 11:52:49,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029883415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:49,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:49,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:52:49,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347387562] [2024-10-24 11:52:49,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:49,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:52:49,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:49,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:52:49,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:52:49,663 INFO L87 Difference]: Start difference. First operand 193 states and 266 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:50,894 INFO L93 Difference]: Finished difference Result 528 states and 742 transitions. [2024-10-24 11:52:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:52:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 122 [2024-10-24 11:52:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:50,897 INFO L225 Difference]: With dead ends: 528 [2024-10-24 11:52:50,897 INFO L226 Difference]: Without dead ends: 336 [2024-10-24 11:52:50,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:52:50,900 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 213 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:50,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 892 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:52:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-24 11:52:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 243. [2024-10-24 11:52:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 196 states have (on average 1.2857142857142858) internal successors, (252), 198 states have internal predecessors, (252), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:52:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 332 transitions. [2024-10-24 11:52:50,953 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 332 transitions. Word has length 122 [2024-10-24 11:52:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:50,953 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 332 transitions. [2024-10-24 11:52:50,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 332 transitions. [2024-10-24 11:52:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:52:50,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:50,955 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:50,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:52:50,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:50,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:50,956 INFO L85 PathProgramCache]: Analyzing trace with hash 124184371, now seen corresponding path program 1 times [2024-10-24 11:52:50,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:50,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556711744] [2024-10-24 11:52:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:50,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:52:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:52:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:52:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:52:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:52:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:52:52,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556711744] [2024-10-24 11:52:52,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556711744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:52,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:52,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:52:52,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282597000] [2024-10-24 11:52:52,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:52,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:52:52,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:52,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:52:52,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:52:52,225 INFO L87 Difference]: Start difference. First operand 243 states and 332 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:53,104 INFO L93 Difference]: Finished difference Result 446 states and 602 transitions. [2024-10-24 11:52:53,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:52:53,105 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 122 [2024-10-24 11:52:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:53,107 INFO L225 Difference]: With dead ends: 446 [2024-10-24 11:52:53,107 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 11:52:53,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:52:53,108 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 153 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:53,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 866 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:52:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 11:52:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 243. [2024-10-24 11:52:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 196 states have (on average 1.2755102040816326) internal successors, (250), 198 states have internal predecessors, (250), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:52:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 330 transitions. [2024-10-24 11:52:53,178 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 330 transitions. Word has length 122 [2024-10-24 11:52:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:53,181 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 330 transitions. [2024-10-24 11:52:53,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:52:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 330 transitions. [2024-10-24 11:52:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:52:53,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:53,183 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:53,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:52:53,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:53,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:53,183 INFO L85 PathProgramCache]: Analyzing trace with hash 181442673, now seen corresponding path program 1 times [2024-10-24 11:52:53,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:53,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517443001] [2024-10-24 11:52:53,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:52:53,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [214120542] [2024-10-24 11:52:53,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:53,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:52:53,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:52:53,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:52:53,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:52:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:52:53,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:52:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:52:54,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:52:54,387 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:52:54,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:52:54,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:52:54,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-24 11:52:54,593 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:54,656 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:52:54,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:52:54 BoogieIcfgContainer [2024-10-24 11:52:54,660 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:52:54,660 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:52:54,661 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:52:54,661 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:52:54,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:36" (3/4) ... [2024-10-24 11:52:54,663 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:52:54,664 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:52:54,665 INFO L158 Benchmark]: Toolchain (without parser) took 19629.73ms. Allocated memory was 161.5MB in the beginning and 474.0MB in the end (delta: 312.5MB). Free memory was 106.9MB in the beginning and 354.0MB in the end (delta: -247.1MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2024-10-24 11:52:54,665 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:52:54,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.89ms. Allocated memory is still 161.5MB. Free memory was 106.9MB in the beginning and 88.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:52:54,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.64ms. Allocated memory is still 161.5MB. Free memory was 88.8MB in the beginning and 84.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:52:54,666 INFO L158 Benchmark]: Boogie Preprocessor took 86.44ms. Allocated memory is still 161.5MB. Free memory was 84.7MB in the beginning and 80.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:52:54,666 INFO L158 Benchmark]: RCFGBuilder took 743.18ms. Allocated memory is still 161.5MB. Free memory was 80.5MB in the beginning and 46.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 11:52:54,666 INFO L158 Benchmark]: TraceAbstraction took 18341.12ms. Allocated memory was 161.5MB in the beginning and 474.0MB in the end (delta: 312.5MB). Free memory was 46.1MB in the beginning and 355.0MB in the end (delta: -308.9MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-10-24 11:52:54,666 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 474.0MB. Free memory was 355.0MB in the beginning and 354.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:52:54,668 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.89ms. Allocated memory is still 161.5MB. Free memory was 106.9MB in the beginning and 88.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.64ms. Allocated memory is still 161.5MB. Free memory was 88.8MB in the beginning and 84.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.44ms. Allocated memory is still 161.5MB. Free memory was 84.7MB in the beginning and 80.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 743.18ms. Allocated memory is still 161.5MB. Free memory was 80.5MB in the beginning and 46.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18341.12ms. Allocated memory was 161.5MB in the beginning and 474.0MB in the end (delta: 312.5MB). Free memory was 46.1MB in the beginning and 355.0MB in the end (delta: -308.9MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 474.0MB. Free memory was 355.0MB in the beginning and 354.0MB in the end (delta: 1.0MB). 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 114, overapproximation of someBinaryArithmeticFLOAToperation at line 78. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] FCALL updateLastVariables() [L122] CALL updateVariables() [L87] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 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_4 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 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_5 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_13 [L100] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_13 [L100] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 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] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_14 [L102] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_14 [L102] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 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] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_15 [L104] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_15 [L104] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 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] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L106] EXPR WrapperStruct00.var_1_16 [L106] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_16 [L106] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 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] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] WrapperStruct00.var_1_20 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] RET updateVariables() [L123] CALL step() [L60] EXPR WrapperStruct00.var_1_14 [L60] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_14 [L61] EXPR WrapperStruct00.var_1_20 [L61] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_20 [L62] EXPR WrapperStruct00.var_1_19 [L62] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L63] EXPR WrapperStruct00.var_1_19 [L63] unsigned char stepLocal_1 = WrapperStruct00.var_1_19; [L64] EXPR WrapperStruct00.var_1_18 [L64] EXPR WrapperStruct00.var_1_18 [L64] EXPR WrapperStruct00.var_1_19 [L64] EXPR WrapperStruct00.var_1_19 [L64] signed long int stepLocal_0 = (WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19); [L65] COND FALSE !(stepLocal_0 >= 1u) [L72] EXPR WrapperStruct00.var_1_19 [L72] WrapperStruct00.var_1_8 = WrapperStruct00.var_1_19 [L74] EXPR WrapperStruct00.var_1_8 [L74] signed long int stepLocal_2 = WrapperStruct00.var_1_8; [L75] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] COND FALSE !(WrapperStruct00.var_1_19 > stepLocal_2) [L78] EXPR WrapperStruct00.var_1_16 [L78] EXPR WrapperStruct00.var_1_14 [L78] EXPR WrapperStruct00.var_1_15 [L78] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)) [L80] EXPR WrapperStruct00.var_1_18 [L80] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L80] COND FALSE !(WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) [L83] EXPR WrapperStruct00.var_1_7 [L83] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_7 [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR WrapperStruct00.var_1_18 [L114] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR (WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) [L114] EXPR WrapperStruct00.var_1_1 [L114] EXPR WrapperStruct00.var_1_7 [L114] EXPR (WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR ((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR ((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) [L114] EXPR WrapperStruct00.var_1_18 [L114] EXPR WrapperStruct00.var_1_18 [L114] EXPR WrapperStruct00.var_1_19 [L114] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR (((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) [L114] EXPR WrapperStruct00.var_1_8 [L114] EXPR WrapperStruct00.var_1_19 [L114] EXPR (((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR ((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR (((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR (((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))))) [L114] EXPR WrapperStruct00.var_1_19 [L114] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR (WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)))) [L114] EXPR WrapperStruct00.var_1_12 [L114] EXPR WrapperStruct00.var_1_16 [L114] EXPR WrapperStruct00.var_1_14 [L114] EXPR WrapperStruct00.var_1_15 [L114] EXPR (WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR (((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR ((((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR ((((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_14)) [L114] EXPR WrapperStruct00.var_1_17 [L114] EXPR WrapperStruct00.var_1_14 [L114] EXPR ((((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR (((((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR (((((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR ((((((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_19 == ((unsigned char) WrapperStruct00.var_1_20)) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR ((((((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_19 == ((unsigned char) WrapperStruct00.var_1_20)) VAL [WrapperStruct00={4:0}, isInitial=1] [L114-L115] return ((((((WrapperStruct00.var_1_18 >= (8u * WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (! (WrapperStruct00.var_1_4 || (WrapperStruct00.var_1_5 || WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((WrapperStruct00.var_1_18 * WrapperStruct00.var_1_18) * (WrapperStruct00.var_1_19 - WrapperStruct00.var_1_19)) >= 1u) ? ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19))) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_19)))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 + ((WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15) - WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_19 == ((unsigned char) WrapperStruct00.var_1_20)) ; [L124] RET, EXPR property() [L124] 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: 18.2s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1522 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1518 mSDsluCounter, 6063 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4550 mSDsCounter, 472 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3847 IncrementalHoareTripleChecker+Invalid, 4319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 472 mSolverCounterUnsat, 1513 mSDtfsCounter, 3847 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 511 GetRequests, 418 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=11, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 327 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1678 NumberOfCodeBlocks, 1678 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1422 ConstructedInterpolants, 0 QuantifiedInterpolants, 4546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 4368/4368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:52:54,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-8.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64fa20811e3d6b4f48d530fd12c5b3e1f5523460c92f2bd0d2e9efe97c916004 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:52:57,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:52:57,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:52:57,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:52:57,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:52:57,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:52:57,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:52:57,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:52:57,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:52:57,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:52:57,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:52:57,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:52:57,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:52:57,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:52:57,164 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:52:57,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:52:57,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:52:57,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:52:57,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:52:57,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:52:57,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:52:57,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:52:57,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:52:57,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:52:57,170 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:52:57,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:52:57,171 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:52:57,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:52:57,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:52:57,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:52:57,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:52:57,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:52:57,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:52:57,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:52:57,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:57,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:52:57,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:52:57,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:52:57,179 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:52:57,180 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:52:57,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:52:57,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:52:57,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:52:57,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:52:57,181 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:52:57,181 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64fa20811e3d6b4f48d530fd12c5b3e1f5523460c92f2bd0d2e9efe97c916004 [2024-10-24 11:52:57,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:52:57,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:52:57,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:52:57,514 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:52:57,516 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:52:57,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-8.i [2024-10-24 11:52:59,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:52:59,389 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:52:59,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-8.i [2024-10-24 11:52:59,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6aae9ea/2eece87ad4ad4697b6fabdc5172831d8/FLAG22afd2695 [2024-10-24 11:52:59,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6aae9ea/2eece87ad4ad4697b6fabdc5172831d8 [2024-10-24 11:52:59,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:52:59,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:52:59,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:59,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:52:59,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:52:59,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:59" (1/1) ... [2024-10-24 11:52:59,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5616264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:59, skipping insertion in model container [2024-10-24 11:52:59,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:59" (1/1) ... [2024-10-24 11:52:59,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:53:00,009 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-8.i[915,928] [2024-10-24 11:53:00,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:53:00,099 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:53:00,111 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-8.i[915,928] [2024-10-24 11:53:00,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:53:00,188 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:53:00,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00 WrapperNode [2024-10-24 11:53:00,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:53:00,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:53:00,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:53:00,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:53:00,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,279 INFO L138 Inliner]: procedures = 33, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2024-10-24 11:53:00,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:53:00,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:53:00,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:53:00,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:53:00,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,336 INFO L175 MemorySlicer]: Split 126 memory accesses to 2 slices as follows [2, 124]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2024-10-24 11:53:00,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:53:00,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:53:00,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:53:00,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:53:00,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (1/1) ... [2024-10-24 11:53:00,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:53:00,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:53:00,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:53:00,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:53:00,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:53:00,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:53:00,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:53:00,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:53:00,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:53:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:53:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:53:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:53:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:53:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:53:00,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:53:00,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:53:00,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:53:00,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:53:00,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:53:00,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:53:00,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:53:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:53:00,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:53:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:53:00,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:53:00,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:53:00,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:53:00,619 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:53:00,621 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:53:02,517 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-24 11:53:02,517 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:53:02,571 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:53:02,572 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:53:02,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:02 BoogieIcfgContainer [2024-10-24 11:53:02,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:53:02,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:53:02,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:53:02,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:53:02,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:52:59" (1/3) ... [2024-10-24 11:53:02,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43255e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:02, skipping insertion in model container [2024-10-24 11:53:02,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:00" (2/3) ... [2024-10-24 11:53:02,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43255e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:02, skipping insertion in model container [2024-10-24 11:53:02,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:02" (3/3) ... [2024-10-24 11:53:02,581 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-8.i [2024-10-24 11:53:02,597 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:53:02,597 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:53:02,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:53:02,661 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;@37a81693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:53:02,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:53:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:53:02,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:02,683 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:02,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:02,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2143100842, now seen corresponding path program 1 times [2024-10-24 11:53:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:02,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981516516] [2024-10-24 11:53:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:02,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:02,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:02,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:02,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:53:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:03,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:53:03,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-10-24 11:53:03,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:03,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:03,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981516516] [2024-10-24 11:53:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981516516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:03,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:53:03,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011222368] [2024-10-24 11:53:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:03,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:53:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:03,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:53:03,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:53:03,237 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:53:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:03,294 INFO L93 Difference]: Finished difference Result 183 states and 288 transitions. [2024-10-24 11:53:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:53:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-10-24 11:53:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:03,305 INFO L225 Difference]: With dead ends: 183 [2024-10-24 11:53:03,306 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:53:03,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:53:03,315 INFO L432 NwaCegarLoop]: 129 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, 129 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-24 11:53:03,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:53:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:53:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 11:53:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-24 11:53:03,365 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 118 [2024-10-24 11:53:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:03,366 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-24 11:53:03,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:53:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-24 11:53:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:53:03,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:03,369 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:03,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:03,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:03,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:03,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1017374914, now seen corresponding path program 1 times [2024-10-24 11:53:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:03,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098299701] [2024-10-24 11:53:03,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:03,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:03,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:03,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:03,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:53:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:04,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:53:04,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:53:04,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:04,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098299701] [2024-10-24 11:53:04,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098299701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:04,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:04,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:53:04,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019907395] [2024-10-24 11:53:04,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:04,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:53:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:04,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:53:04,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:53:04,093 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:53:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:04,222 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2024-10-24 11:53:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:53:04,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-24 11:53:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:04,226 INFO L225 Difference]: With dead ends: 186 [2024-10-24 11:53:04,227 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 11:53:04,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:53:04,230 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:04,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 486 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:53:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 11:53:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-24 11:53:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-10-24 11:53:04,252 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 118 [2024-10-24 11:53:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:04,253 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-10-24 11:53:04,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:53:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-10-24 11:53:04,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:53:04,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:04,255 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:04,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:53:04,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:04,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:04,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash 208028288, now seen corresponding path program 1 times [2024-10-24 11:53:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015985230] [2024-10-24 11:53:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:04,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:04,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:04,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:04,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:53:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:04,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:53:04,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:53:04,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:04,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:04,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015985230] [2024-10-24 11:53:04,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015985230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:04,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:04,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:53:04,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055266420] [2024-10-24 11:53:04,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:04,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:53:04,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:04,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:53:04,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:53:04,900 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:53:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:05,031 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-10-24 11:53:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:53:05,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-24 11:53:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:05,035 INFO L225 Difference]: With dead ends: 192 [2024-10-24 11:53:05,037 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 11:53:05,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:53:05,039 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:05,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 598 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:53:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 11:53:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-24 11:53:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-10-24 11:53:05,057 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 118 [2024-10-24 11:53:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:05,058 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-10-24 11:53:05,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:53:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-10-24 11:53:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:53:05,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:05,064 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:05,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:05,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:05,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:05,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash 265286590, now seen corresponding path program 1 times [2024-10-24 11:53:05,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:05,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849634689] [2024-10-24 11:53:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:05,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:05,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:05,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:05,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:53:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:05,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:53:05,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:53:05,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:05,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849634689] [2024-10-24 11:53:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849634689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:05,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:05,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:53:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595549240] [2024-10-24 11:53:05,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:05,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:53:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:05,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:53:05,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:53:05,675 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:53:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:05,812 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-10-24 11:53:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:53:05,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-24 11:53:05,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:05,816 INFO L225 Difference]: With dead ends: 196 [2024-10-24 11:53:05,817 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:53:05,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:53:05,820 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:05,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 712 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:53:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:53:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-24 11:53:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-10-24 11:53:05,834 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 118 [2024-10-24 11:53:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:05,837 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-10-24 11:53:05,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:53:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-10-24 11:53:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 11:53:05,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:05,840 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:05,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:06,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:06,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:06,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash 265346172, now seen corresponding path program 1 times [2024-10-24 11:53:06,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:06,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348068524] [2024-10-24 11:53:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:06,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:06,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:06,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:06,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:53:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:06,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:53:06,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:06,723 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-24 11:53:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-24 11:53:06,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:06,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:06,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348068524] [2024-10-24 11:53:06,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348068524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:06,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:06,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:53:06,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886325710] [2024-10-24 11:53:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:06,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:53:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:06,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:53:06,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:53:06,766 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:53:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:09,342 INFO L93 Difference]: Finished difference Result 198 states and 282 transitions. [2024-10-24 11:53:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:53:09,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-10-24 11:53:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:09,346 INFO L225 Difference]: With dead ends: 198 [2024-10-24 11:53:09,346 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:53:09,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:53:09,348 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 97 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:09,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 365 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 11:53:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:53:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-24 11:53:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-10-24 11:53:09,367 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 118 [2024-10-24 11:53:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:09,367 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-10-24 11:53:09,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:53:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-10-24 11:53:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:53:09,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:09,369 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:09,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:53:09,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:09,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:09,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:09,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1150468222, now seen corresponding path program 1 times [2024-10-24 11:53:09,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:09,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290696001] [2024-10-24 11:53:09,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:09,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:09,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:09,572 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:09,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:53:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:09,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:53:09,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:10,166 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 95 treesize of output 41 [2024-10-24 11:53:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-24 11:53:10,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:10,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290696001] [2024-10-24 11:53:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290696001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:10,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:53:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38332076] [2024-10-24 11:53:10,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:10,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:53:10,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:10,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:53:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:53:10,196 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:53:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:13,376 INFO L93 Difference]: Finished difference Result 198 states and 280 transitions. [2024-10-24 11:53:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:53:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-24 11:53:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:13,378 INFO L225 Difference]: With dead ends: 198 [2024-10-24 11:53:13,378 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:53:13,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:53:13,379 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 88 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:13,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 360 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-24 11:53:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:53:13,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-24 11:53:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2024-10-24 11:53:13,392 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 120 [2024-10-24 11:53:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:13,393 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2024-10-24 11:53:13,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:53:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2024-10-24 11:53:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 11:53:13,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:13,395 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:13,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 11:53:13,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:13,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:13,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1706403772, now seen corresponding path program 1 times [2024-10-24 11:53:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:13,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189567784] [2024-10-24 11:53:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:13,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:13,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:13,598 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:13,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:53:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:13,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:53:14,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:14,210 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 95 treesize of output 41 [2024-10-24 11:53:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-24 11:53:14,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:14,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:14,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189567784] [2024-10-24 11:53:14,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189567784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:14,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:14,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:53:14,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577588268] [2024-10-24 11:53:14,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:14,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:53:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:14,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:53:14,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:53:14,241 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:53:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:16,501 INFO L93 Difference]: Finished difference Result 198 states and 278 transitions. [2024-10-24 11:53:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:53:16,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 122 [2024-10-24 11:53:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:16,503 INFO L225 Difference]: With dead ends: 198 [2024-10-24 11:53:16,503 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:53:16,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:53:16,504 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:16,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 356 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 11:53:16,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:53:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-24 11:53:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-10-24 11:53:16,510 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 122 [2024-10-24 11:53:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:16,510 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-10-24 11:53:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:53:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-10-24 11:53:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 11:53:16,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:16,512 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:16,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 11:53:16,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:16,717 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:16,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:16,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1870652222, now seen corresponding path program 1 times [2024-10-24 11:53:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:16,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881176814] [2024-10-24 11:53:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:16,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:16,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:16,721 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:16,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:53:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:17,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 11:53:17,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:17,206 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-24 11:53:17,417 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 42 treesize of output 20 [2024-10-24 11:53:17,482 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 42 treesize of output 20 [2024-10-24 11:53:17,562 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 42 treesize of output 20 [2024-10-24 11:53:17,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 42 treesize of output 20 [2024-10-24 11:53:17,710 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 42 treesize of output 20 [2024-10-24 11:53:17,799 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 64 treesize of output 20 [2024-10-24 11:53:17,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:17,820 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 44 treesize of output 40 [2024-10-24 11:53:17,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:17,902 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 59 treesize of output 43 [2024-10-24 11:53:17,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:17,940 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 59 treesize of output 52 [2024-10-24 11:53:18,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:18,047 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 99 treesize of output 45 [2024-10-24 11:53:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 202 proven. 36 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-24 11:53:18,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:53:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:53:18,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:18,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881176814] [2024-10-24 11:53:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881176814] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:53:18,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:53:18,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2024-10-24 11:53:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775930263] [2024-10-24 11:53:18,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:53:18,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:53:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:53:18,277 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:53:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:20,413 INFO L93 Difference]: Finished difference Result 251 states and 346 transitions. [2024-10-24 11:53:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:53:20,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2024-10-24 11:53:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:20,417 INFO L225 Difference]: With dead ends: 251 [2024-10-24 11:53:20,417 INFO L226 Difference]: Without dead ends: 153 [2024-10-24 11:53:20,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:53:20,418 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 57 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:20,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 414 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 11:53:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-24 11:53:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2024-10-24 11:53:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 128 states have internal predecessors, (166), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:53:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 206 transitions. [2024-10-24 11:53:20,433 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 206 transitions. Word has length 124 [2024-10-24 11:53:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:20,434 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 206 transitions. [2024-10-24 11:53:20,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:53:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 206 transitions. [2024-10-24 11:53:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:53:20,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:20,436 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:20,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 11:53:20,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:20,637 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:20,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:20,637 INFO L85 PathProgramCache]: Analyzing trace with hash 236626631, now seen corresponding path program 1 times [2024-10-24 11:53:20,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:20,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150028430] [2024-10-24 11:53:20,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:20,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:20,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:20,639 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:20,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 11:53:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:21,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 11:53:21,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:21,125 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-24 11:53:21,292 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 41 treesize of output 19 [2024-10-24 11:53:21,393 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 41 treesize of output 19 [2024-10-24 11:53:21,502 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 36 treesize of output 29 [2024-10-24 11:53:21,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:21,763 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-24 11:53:21,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:21,909 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-24 11:53:22,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:22,066 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-24 11:53:22,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:22,232 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-24 11:53:22,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:22,378 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-24 11:53:22,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:22,657 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 78 treesize of output 64 [2024-10-24 11:53:22,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:22,765 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 83 [2024-10-24 11:53:22,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:22,937 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 93 treesize of output 86 [2024-10-24 11:53:23,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:23,074 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 101 treesize of output 47 [2024-10-24 11:53:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 239 proven. 36 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-24 11:53:23,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:53:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 11:53:23,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150028430] [2024-10-24 11:53:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150028430] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:53:23,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:53:23,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2024-10-24 11:53:23,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7617082] [2024-10-24 11:53:23,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:53:23,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 11:53:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:23,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 11:53:23,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:53:23,474 INFO L87 Difference]: Start difference. First operand 150 states and 206 transitions. Second operand has 16 states, 14 states have (on average 8.214285714285714) internal successors, (115), 16 states have internal predecessors, (115), 8 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2024-10-24 11:53:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:27,140 INFO L93 Difference]: Finished difference Result 326 states and 434 transitions. [2024-10-24 11:53:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 11:53:27,144 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.214285714285714) internal successors, (115), 16 states have internal predecessors, (115), 8 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) Word has length 126 [2024-10-24 11:53:27,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:27,149 INFO L225 Difference]: With dead ends: 326 [2024-10-24 11:53:27,149 INFO L226 Difference]: Without dead ends: 177 [2024-10-24 11:53:27,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2024-10-24 11:53:27,150 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 154 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:27,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 291 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 11:53:27,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-24 11:53:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 115. [2024-10-24 11:53:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.28125) internal successors, (123), 96 states have internal predecessors, (123), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2024-10-24 11:53:27,169 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 126 [2024-10-24 11:53:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:27,170 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2024-10-24 11:53:27,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.214285714285714) internal successors, (115), 16 states have internal predecessors, (115), 8 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 8 states have call successors, (28) [2024-10-24 11:53:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2024-10-24 11:53:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:53:27,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:27,172 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:27,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 11:53:27,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:27,373 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:27,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1819098585, now seen corresponding path program 1 times [2024-10-24 11:53:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:27,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579663513] [2024-10-24 11:53:27,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:27,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:27,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:27,376 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:27,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 11:53:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:27,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 11:53:27,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:27,777 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-24 11:53:27,896 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 41 treesize of output 19 [2024-10-24 11:53:27,987 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 41 treesize of output 19 [2024-10-24 11:53:28,086 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 41 treesize of output 19 [2024-10-24 11:53:28,193 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 41 treesize of output 19 [2024-10-24 11:53:28,258 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 41 treesize of output 19 [2024-10-24 11:53:28,337 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 41 treesize of output 19 [2024-10-24 11:53:28,406 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 41 treesize of output 19 [2024-10-24 11:53:28,467 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 41 treesize of output 19 [2024-10-24 11:53:28,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:28,559 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 67 treesize of output 41 [2024-10-24 11:53:28,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:28,627 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 51 treesize of output 59 [2024-10-24 11:53:28,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:28,736 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 66 treesize of output 62 [2024-10-24 11:53:28,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:28,792 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 66 treesize of output 80 [2024-10-24 11:53:28,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:28,949 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 89 treesize of output 37 [2024-10-24 11:53:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-24 11:53:28,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:53:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 11:53:29,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:29,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579663513] [2024-10-24 11:53:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579663513] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:53:29,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:53:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2024-10-24 11:53:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360663164] [2024-10-24 11:53:29,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:53:29,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:53:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:53:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:53:29,277 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 15 states, 13 states have (on average 8.538461538461538) internal successors, (111), 15 states have internal predecessors, (111), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-24 11:53:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:33,091 INFO L93 Difference]: Finished difference Result 270 states and 352 transitions. [2024-10-24 11:53:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:53:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.538461538461538) internal successors, (111), 15 states have internal predecessors, (111), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) Word has length 126 [2024-10-24 11:53:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:33,094 INFO L225 Difference]: With dead ends: 270 [2024-10-24 11:53:33,094 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 11:53:33,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:53:33,095 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 299 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:33,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 294 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 11:53:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 11:53:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 115. [2024-10-24 11:53:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 96 states have internal predecessors, (122), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2024-10-24 11:53:33,110 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 126 [2024-10-24 11:53:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:33,110 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2024-10-24 11:53:33,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.538461538461538) internal successors, (111), 15 states have internal predecessors, (111), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-24 11:53:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2024-10-24 11:53:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 11:53:33,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:33,112 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:33,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:33,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:33,313 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:33,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash 132543504, now seen corresponding path program 1 times [2024-10-24 11:53:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:33,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702986796] [2024-10-24 11:53:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:33,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:33,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:33,315 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:33,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 11:53:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:33,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 11:53:33,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:33,775 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-24 11:53:33,778 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 21 treesize of output 21 [2024-10-24 11:53:33,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:33,801 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 37 treesize of output 24 [2024-10-24 11:53:33,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:33,816 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 37 treesize of output 42 [2024-10-24 11:53:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:53:33,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:33,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:33,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702986796] [2024-10-24 11:53:33,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702986796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:33,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:33,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:53:33,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517816783] [2024-10-24 11:53:33,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:33,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:53:33,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:33,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:53:33,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:53:33,902 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:53:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:37,150 INFO L93 Difference]: Finished difference Result 354 states and 458 transitions. [2024-10-24 11:53:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:53:37,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2024-10-24 11:53:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:37,153 INFO L225 Difference]: With dead ends: 354 [2024-10-24 11:53:37,153 INFO L226 Difference]: Without dead ends: 240 [2024-10-24 11:53:37,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:53:37,154 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 185 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:37,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 768 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-24 11:53:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-24 11:53:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 118. [2024-10-24 11:53:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 99 states have internal predecessors, (125), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2024-10-24 11:53:37,168 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 126 [2024-10-24 11:53:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:37,169 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2024-10-24 11:53:37,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:53:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2024-10-24 11:53:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:53:37,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:37,170 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:37,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:37,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:37,371 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:37,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1372839347, now seen corresponding path program 1 times [2024-10-24 11:53:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:37,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745351532] [2024-10-24 11:53:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:37,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:37,373 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:37,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 11:53:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:37,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 11:53:37,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:37,776 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-24 11:53:37,837 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-24 11:53:37,880 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-24 11:53:37,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:37,969 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-24 11:53:38,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:38,023 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-24 11:53:38,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:38,117 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-24 11:53:38,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:38,200 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-24 11:53:38,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:38,269 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-24 11:53:38,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:38,395 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 63 treesize of output 28 [2024-10-24 11:53:38,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:38,413 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 43 treesize of output 48 [2024-10-24 11:53:38,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:38,495 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 51 [2024-10-24 11:53:38,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:38,530 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 66 treesize of output 30 [2024-10-24 11:53:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 203 proven. 30 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-10-24 11:53:38,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:53:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 11:53:38,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:38,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745351532] [2024-10-24 11:53:38,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745351532] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:53:38,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:53:38,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-10-24 11:53:38,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598840960] [2024-10-24 11:53:38,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:53:38,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:53:38,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:38,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:53:38,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:53:38,796 INFO L87 Difference]: Start difference. First operand 118 states and 153 transitions. Second operand has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 states have internal predecessors, (107), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-24 11:53:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:41,536 INFO L93 Difference]: Finished difference Result 258 states and 328 transitions. [2024-10-24 11:53:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 11:53:41,537 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 states have internal predecessors, (107), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) Word has length 128 [2024-10-24 11:53:41,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:41,538 INFO L225 Difference]: With dead ends: 258 [2024-10-24 11:53:41,538 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 11:53:41,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:53:41,539 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 119 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:41,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 255 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 11:53:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 11:53:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2024-10-24 11:53:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:53:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 155 transitions. [2024-10-24 11:53:41,554 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 155 transitions. Word has length 128 [2024-10-24 11:53:41,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:41,555 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 155 transitions. [2024-10-24 11:53:41,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 states have internal predecessors, (107), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-24 11:53:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 155 transitions. [2024-10-24 11:53:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:53:41,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:41,556 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:53:41,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:41,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:41,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:41,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash 927983243, now seen corresponding path program 1 times [2024-10-24 11:53:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:41,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215557268] [2024-10-24 11:53:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:41,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:53:41,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:41,760 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:53:41,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 11:53:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:42,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-24 11:53:42,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:42,200 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-24 11:53:42,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-24 11:53:42,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:42,670 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 63 treesize of output 38 [2024-10-24 11:53:42,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:42,874 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 63 treesize of output 38 [2024-10-24 11:53:43,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:43,106 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 63 treesize of output 38 [2024-10-24 11:53:43,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:43,283 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 63 treesize of output 38 [2024-10-24 11:53:43,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:43,419 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 58 treesize of output 48 [2024-10-24 11:53:43,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:43,781 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 51 [2024-10-24 11:53:43,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:43,861 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 75 treesize of output 71 [2024-10-24 11:53:43,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:43,988 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 74 [2024-10-24 11:53:44,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:44,407 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 83 treesize of output 82 [2024-10-24 11:53:44,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:44,577 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 101 treesize of output 47 [2024-10-24 11:53:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 237 proven. 54 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 11:53:44,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:53:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 48 proven. 60 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-24 11:53:46,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:46,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215557268] [2024-10-24 11:53:46,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215557268] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:53:46,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:53:46,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 37 [2024-10-24 11:53:46,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180653061] [2024-10-24 11:53:46,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:53:46,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-24 11:53:46,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:46,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-24 11:53:46,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 11:53:46,354 INFO L87 Difference]: Start difference. First operand 122 states and 155 transitions. Second operand has 37 states, 31 states have (on average 4.032258064516129) internal successors, (125), 33 states have internal predecessors, (125), 10 states have call successors, (23), 5 states have call predecessors, (23), 9 states have return successors, (23), 7 states have call predecessors, (23), 10 states have call successors, (23)