./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-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-83.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 e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:01:10,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:01:10,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:01:10,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:01:10,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:01:10,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:01:10,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:01:10,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:01:10,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:01:10,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:01:10,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:01:10,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:01:10,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:01:10,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:01:10,627 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:01:10,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:01:10,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:01:10,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:01:10,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:01:10,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:01:10,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:01:10,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:01:10,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:01:10,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:01:10,629 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:01:10,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:01:10,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:01:10,630 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:01:10,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:01:10,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:01:10,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:01:10,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:01:10,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:01:10,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:01:10,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:01:10,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:01:10,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:01:10,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:01:10,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:01:10,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:01:10,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:01:10,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:01:10,633 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 -> e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 [2024-10-14 14:01:10,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:01:10,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:01:10,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:01:10,873 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:01:10,873 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:01:10,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-10-14 14:01:12,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:01:12,400 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:01:12,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-10-14 14:01:12,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a47eb48c3/27b80d353c364368b839b3712d854814/FLAGbcc306c0e [2024-10-14 14:01:12,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a47eb48c3/27b80d353c364368b839b3712d854814 [2024-10-14 14:01:12,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:01:12,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:01:12,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:01:12,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:01:12,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:01:12,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7296254d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12, skipping insertion in model container [2024-10-14 14:01:12,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:01:12,595 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-83.i[916,929] [2024-10-14 14:01:12,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:01:12,690 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:01:12,704 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-83.i[916,929] [2024-10-14 14:01:12,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:01:12,753 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:01:12,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12 WrapperNode [2024-10-14 14:01:12,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:01:12,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:01:12,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:01:12,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:01:12,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,811 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2024-10-14 14:01:12,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:01:12,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:01:12,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:01:12,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:01:12,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,860 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-14 14:01:12,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:01:12,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:01:12,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:01:12,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:01:12,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (1/1) ... [2024-10-14 14:01:12,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:01:12,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:12,940 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-14 14:01:12,942 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-14 14:01:12,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:01:12,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 14:01:12,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 14:01:12,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:01:12,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:01:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 14:01:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 14:01:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:01:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:01:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 14:01:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 14:01:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:01:12,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:01:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:01:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:01:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:01:12,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:01:13,091 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:01:13,093 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:01:13,521 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-10-14 14:01:13,521 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:01:13,565 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:01:13,565 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:01:13,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:01:13 BoogieIcfgContainer [2024-10-14 14:01:13,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:01:13,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:01:13,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:01:13,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:01:13,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:01:12" (1/3) ... [2024-10-14 14:01:13,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563268ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:01:13, skipping insertion in model container [2024-10-14 14:01:13,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:12" (2/3) ... [2024-10-14 14:01:13,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563268ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:01:13, skipping insertion in model container [2024-10-14 14:01:13,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:01:13" (3/3) ... [2024-10-14 14:01:13,576 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-83.i [2024-10-14 14:01:13,590 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:01:13,590 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:01:13,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:01:13,656 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;@756ec5b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:01:13,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:01:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:01:13,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:13,671 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:13,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:13,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1677763838, now seen corresponding path program 1 times [2024-10-14 14:01:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:13,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778574414] [2024-10-14 14:01:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:13,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778574414] [2024-10-14 14:01:14,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778574414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:14,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:14,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:01:14,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427986036] [2024-10-14 14:01:14,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:14,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:01:14,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:14,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:01:14,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:01:14,028 INFO L87 Difference]: Start difference. First operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:14,062 INFO L93 Difference]: Finished difference Result 207 states and 327 transitions. [2024-10-14 14:01:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:01:14,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-14 14:01:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:14,072 INFO L225 Difference]: With dead ends: 207 [2024-10-14 14:01:14,073 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 14:01:14,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:01:14,080 INFO L432 NwaCegarLoop]: 144 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, 144 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-14 14:01:14,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 14:01:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-14 14:01:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-10-14 14:01:14,114 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 101 [2024-10-14 14:01:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:14,115 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-10-14 14:01:14,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-10-14 14:01:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:01:14,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:14,122 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:14,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:01:14,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:14,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash -3535280, now seen corresponding path program 1 times [2024-10-14 14:01:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:14,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782460841] [2024-10-14 14:01:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:14,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782460841] [2024-10-14 14:01:14,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782460841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:14,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:14,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:01:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829230872] [2024-10-14 14:01:14,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:14,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:01:14,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:14,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:01:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:14,419 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:14,489 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2024-10-14 14:01:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:01:14,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-14 14:01:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:14,490 INFO L225 Difference]: With dead ends: 207 [2024-10-14 14:01:14,491 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 14:01:14,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:14,492 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:14,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 419 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 14:01:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-14 14:01:14,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-10-14 14:01:14,506 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 101 [2024-10-14 14:01:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:14,509 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-10-14 14:01:14,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-10-14 14:01:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:01:14,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:14,512 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:14,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:01:14,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:14,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:14,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1942697326, now seen corresponding path program 1 times [2024-10-14 14:01:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007325821] [2024-10-14 14:01:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:14,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:14,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007325821] [2024-10-14 14:01:14,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007325821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:14,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:14,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:01:14,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497163667] [2024-10-14 14:01:14,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:14,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:01:14,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:14,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:01:14,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:14,738 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:14,791 INFO L93 Difference]: Finished difference Result 212 states and 303 transitions. [2024-10-14 14:01:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:01:14,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:01:14,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:14,795 INFO L225 Difference]: With dead ends: 212 [2024-10-14 14:01:14,795 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 14:01:14,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:14,796 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 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-14 14:01:14,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 14:01:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-14 14:01:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-10-14 14:01:14,816 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 101 [2024-10-14 14:01:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:14,816 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-10-14 14:01:14,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-10-14 14:01:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:01:14,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:14,818 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:14,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:01:14,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:14,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1542923344, now seen corresponding path program 1 times [2024-10-14 14:01:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245423287] [2024-10-14 14:01:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:14,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:14,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245423287] [2024-10-14 14:01:14,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245423287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:14,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:14,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:01:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687479200] [2024-10-14 14:01:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:14,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:01:14,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:14,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:01:14,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:14,975 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:15,017 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2024-10-14 14:01:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:01:15,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:01:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:15,020 INFO L225 Difference]: With dead ends: 216 [2024-10-14 14:01:15,021 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 14:01:15,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:15,022 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 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-14 14:01:15,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:15,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 14:01:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-14 14:01:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-14 14:01:15,041 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 101 [2024-10-14 14:01:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:15,041 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-14 14:01:15,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-14 14:01:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:01:15,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:15,046 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:15,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:01:15,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:15,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1600181646, now seen corresponding path program 1 times [2024-10-14 14:01:15,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:15,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614828734] [2024-10-14 14:01:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:15,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:15,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:15,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614828734] [2024-10-14 14:01:15,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614828734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:15,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:15,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:01:15,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756579285] [2024-10-14 14:01:15,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:15,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:01:15,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:15,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:01:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:15,200 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:15,239 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-10-14 14:01:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:01:15,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:01:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:15,242 INFO L225 Difference]: With dead ends: 220 [2024-10-14 14:01:15,243 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 14:01:15,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:15,246 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 420 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-14 14:01:15,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 14:01:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-14 14:01:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-10-14 14:01:15,253 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 101 [2024-10-14 14:01:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:15,253 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-10-14 14:01:15,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-10-14 14:01:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:01:15,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:15,255 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:15,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:01:15,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:15,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:15,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1600241228, now seen corresponding path program 1 times [2024-10-14 14:01:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:15,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477594300] [2024-10-14 14:01:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:15,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:15,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477594300] [2024-10-14 14:01:15,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477594300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:15,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:15,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:01:15,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730693958] [2024-10-14 14:01:15,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:15,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:01:15,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:15,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:01:15,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:15,557 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:15,709 INFO L93 Difference]: Finished difference Result 221 states and 311 transitions. [2024-10-14 14:01:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:01:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:01:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:15,711 INFO L225 Difference]: With dead ends: 221 [2024-10-14 14:01:15,711 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 14:01:15,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:01:15,713 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 133 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:15,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 141 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:01:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 14:01:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-14 14:01:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-10-14 14:01:15,726 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 101 [2024-10-14 14:01:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:15,727 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-10-14 14:01:15,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-10-14 14:01:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:01:15,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:15,730 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:15,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:01:15,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:15,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash -901193252, now seen corresponding path program 1 times [2024-10-14 14:01:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:15,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520651179] [2024-10-14 14:01:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:15,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:15,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520651179] [2024-10-14 14:01:15,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520651179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:15,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:15,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:01:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371801531] [2024-10-14 14:01:15,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:15,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:01:15,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:15,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:01:15,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:01:15,894 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:16,048 INFO L93 Difference]: Finished difference Result 223 states and 312 transitions. [2024-10-14 14:01:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:01:16,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-14 14:01:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:16,049 INFO L225 Difference]: With dead ends: 223 [2024-10-14 14:01:16,049 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 14:01:16,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:16,050 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:16,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 410 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:01:16,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 14:01:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-14 14:01:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-10-14 14:01:16,056 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 102 [2024-10-14 14:01:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:16,056 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-10-14 14:01:16,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-10-14 14:01:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:01:16,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:16,058 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:16,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:01:16,058 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:16,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash 402218610, now seen corresponding path program 1 times [2024-10-14 14:01:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:16,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085588244] [2024-10-14 14:01:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:16,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:17,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085588244] [2024-10-14 14:01:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085588244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:17,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:17,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 14:01:17,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034497294] [2024-10-14 14:01:17,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:17,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 14:01:17,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:17,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 14:01:17,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:01:17,239 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:17,712 INFO L93 Difference]: Finished difference Result 304 states and 420 transitions. [2024-10-14 14:01:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:01:17,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-14 14:01:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:17,714 INFO L225 Difference]: With dead ends: 304 [2024-10-14 14:01:17,714 INFO L226 Difference]: Without dead ends: 192 [2024-10-14 14:01:17,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:01:17,715 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 82 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:17,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 627 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:01:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-14 14:01:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-10-14 14:01:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 172 states have internal predecessors, (231), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 14:01:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 261 transitions. [2024-10-14 14:01:17,725 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 261 transitions. Word has length 103 [2024-10-14 14:01:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:17,726 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 261 transitions. [2024-10-14 14:01:17,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 261 transitions. [2024-10-14 14:01:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:01:17,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:17,729 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:17,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:01:17,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:17,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash -877645068, now seen corresponding path program 1 times [2024-10-14 14:01:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692217916] [2024-10-14 14:01:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716994461] [2024-10-14 14:01:17,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:17,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:17,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:17,813 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-14 14:01:17,815 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-14 14:01:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:18,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 14:01:18,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:18,187 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 29 treesize of output 13 [2024-10-14 14:01:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:18,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:18,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:18,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692217916] [2024-10-14 14:01:18,212 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:01:18,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716994461] [2024-10-14 14:01:18,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716994461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:18,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:18,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:01:18,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178148053] [2024-10-14 14:01:18,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:18,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:01:18,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:18,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:01:18,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:01:18,215 INFO L87 Difference]: Start difference. First operand 189 states and 261 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:18,525 INFO L93 Difference]: Finished difference Result 537 states and 743 transitions. [2024-10-14 14:01:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:01:18,526 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-14 14:01:18,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:18,528 INFO L225 Difference]: With dead ends: 537 [2024-10-14 14:01:18,529 INFO L226 Difference]: Without dead ends: 349 [2024-10-14 14:01:18,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:18,530 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 110 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:18,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 422 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:01:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-14 14:01:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 209. [2024-10-14 14:01:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 192 states have internal predecessors, (261), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 14:01:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 291 transitions. [2024-10-14 14:01:18,542 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 291 transitions. Word has length 103 [2024-10-14 14:01:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:18,543 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 291 transitions. [2024-10-14 14:01:18,543 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 291 transitions. [2024-10-14 14:01:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:01:18,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:18,544 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:18,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 14:01:18,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:18,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:18,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1898713422, now seen corresponding path program 1 times [2024-10-14 14:01:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444431624] [2024-10-14 14:01:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:18,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791871066] [2024-10-14 14:01:18,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:18,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:18,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:18,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:18,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 14:01:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:18,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 14:01:18,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:19,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:19,011 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 38 treesize of output 40 [2024-10-14 14:01:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:19,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:19,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:19,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444431624] [2024-10-14 14:01:19,088 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:01:19,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791871066] [2024-10-14 14:01:19,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791871066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:19,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:19,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:01:19,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676668300] [2024-10-14 14:01:19,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:19,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:01:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:19,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:01:19,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:19,090 INFO L87 Difference]: Start difference. First operand 209 states and 291 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:19,583 INFO L93 Difference]: Finished difference Result 557 states and 775 transitions. [2024-10-14 14:01:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:01:19,584 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-14 14:01:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:19,586 INFO L225 Difference]: With dead ends: 557 [2024-10-14 14:01:19,586 INFO L226 Difference]: Without dead ends: 349 [2024-10-14 14:01:19,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:19,587 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 214 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:19,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 307 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 14:01:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-14 14:01:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 213. [2024-10-14 14:01:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 195 states have (on average 1.3641025641025641) internal successors, (266), 196 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 14:01:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 296 transitions. [2024-10-14 14:01:19,599 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 296 transitions. Word has length 103 [2024-10-14 14:01:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:19,600 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 296 transitions. [2024-10-14 14:01:19,600 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 296 transitions. [2024-10-14 14:01:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:01:19,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:19,601 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:19,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 14:01:19,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 14:01:19,802 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash -487259373, now seen corresponding path program 1 times [2024-10-14 14:01:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:19,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929135821] [2024-10-14 14:01:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929135821] [2024-10-14 14:01:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929135821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:20,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:20,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:01:20,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175841924] [2024-10-14 14:01:20,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:20,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:01:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:20,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:01:20,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:20,159 INFO L87 Difference]: Start difference. First operand 213 states and 296 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 14:01:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:20,422 INFO L93 Difference]: Finished difference Result 425 states and 591 transitions. [2024-10-14 14:01:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:01:20,423 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), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2024-10-14 14:01:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:20,424 INFO L225 Difference]: With dead ends: 425 [2024-10-14 14:01:20,424 INFO L226 Difference]: Without dead ends: 213 [2024-10-14 14:01:20,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:01:20,425 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 216 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:20,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 186 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:01:20,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-14 14:01:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-10-14 14:01:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 195 states have (on average 1.353846153846154) internal successors, (264), 196 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 14:01:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 294 transitions. [2024-10-14 14:01:20,435 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 294 transitions. Word has length 103 [2024-10-14 14:01:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:20,435 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 294 transitions. [2024-10-14 14:01:20,435 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), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 14:01:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2024-10-14 14:01:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:01:20,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:20,436 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:20,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 14:01:20,437 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:20,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1304378290, now seen corresponding path program 1 times [2024-10-14 14:01:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:20,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621269710] [2024-10-14 14:01:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:20,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971303667] [2024-10-14 14:01:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:20,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:20,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:20,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:20,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 14:01:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:20,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 14:01:20,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:20,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:20,720 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 27 treesize of output 29 [2024-10-14 14:01:20,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:20,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 10 [2024-10-14 14:01:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:20,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:20,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:20,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621269710] [2024-10-14 14:01:20,828 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:01:20,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971303667] [2024-10-14 14:01:20,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971303667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:20,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:20,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:01:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352797536] [2024-10-14 14:01:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:20,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:01:20,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:20,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:01:20,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:20,829 INFO L87 Difference]: Start difference. First operand 213 states and 294 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:21,878 INFO L93 Difference]: Finished difference Result 602 states and 827 transitions. [2024-10-14 14:01:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:01:21,880 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-14 14:01:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:21,881 INFO L225 Difference]: With dead ends: 602 [2024-10-14 14:01:21,881 INFO L226 Difference]: Without dead ends: 390 [2024-10-14 14:01:21,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:01:21,882 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 202 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:21,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 746 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 14:01:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-14 14:01:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 385. [2024-10-14 14:01:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 349 states have (on average 1.346704871060172) internal successors, (470), 352 states have internal predecessors, (470), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 14:01:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 530 transitions. [2024-10-14 14:01:21,925 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 530 transitions. Word has length 103 [2024-10-14 14:01:21,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:21,926 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 530 transitions. [2024-10-14 14:01:21,926 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 530 transitions. [2024-10-14 14:01:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:01:21,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:21,929 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:21,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 14:01:22,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:22,130 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:22,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1886780784, now seen corresponding path program 1 times [2024-10-14 14:01:22,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:22,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505558705] [2024-10-14 14:01:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:22,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-14 14:01:23,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505558705] [2024-10-14 14:01:23,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505558705] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:01:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11839696] [2024-10-14 14:01:23,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:23,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:23,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:23,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:23,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 14:01:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:23,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-14 14:01:23,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:23,701 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 7 treesize of output 3 [2024-10-14 14:01:23,729 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 15 treesize of output 1 [2024-10-14 14:01:23,755 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 15 treesize of output 1 [2024-10-14 14:01:23,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 15 treesize of output 1 [2024-10-14 14:01:23,788 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 15 treesize of output 1 [2024-10-14 14:01:23,803 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 15 treesize of output 1 [2024-10-14 14:01:23,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2024-10-14 14:01:23,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:23,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2024-10-14 14:01:24,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:24,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-10-14 14:01:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:24,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:24,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11839696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:24,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 14:01:24,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2024-10-14 14:01:24,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483517889] [2024-10-14 14:01:24,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:24,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 14:01:24,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:24,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 14:01:24,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-10-14 14:01:24,232 INFO L87 Difference]: Start difference. First operand 385 states and 530 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:24,910 INFO L93 Difference]: Finished difference Result 797 states and 1097 transitions. [2024-10-14 14:01:24,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:01:24,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-14 14:01:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:24,917 INFO L225 Difference]: With dead ends: 797 [2024-10-14 14:01:24,918 INFO L226 Difference]: Without dead ends: 413 [2024-10-14 14:01:24,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-14 14:01:24,919 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 183 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:24,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 348 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 14:01:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-14 14:01:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 386. [2024-10-14 14:01:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 350 states have (on average 1.3457142857142856) internal successors, (471), 353 states have internal predecessors, (471), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 14:01:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 531 transitions. [2024-10-14 14:01:24,947 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 531 transitions. Word has length 103 [2024-10-14 14:01:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:24,948 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 531 transitions. [2024-10-14 14:01:24,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 531 transitions. [2024-10-14 14:01:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:01:24,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:24,950 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:24,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 14:01:25,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:25,151 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:25,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash 794905200, now seen corresponding path program 1 times [2024-10-14 14:01:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564125996] [2024-10-14 14:01:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-14 14:01:26,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:26,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564125996] [2024-10-14 14:01:26,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564125996] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:01:26,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681500967] [2024-10-14 14:01:26,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:26,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:26,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:26,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:26,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 14:01:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:26,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 14:01:26,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:26,768 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 15 treesize of output 1 [2024-10-14 14:01:26,865 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 14 [2024-10-14 14:01:26,905 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 14 [2024-10-14 14:01:26,946 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 14 [2024-10-14 14:01:27,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 14 [2024-10-14 14:01:27,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:27,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2024-10-14 14:01:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 118 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-14 14:01:27,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:01:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-14 14:01:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681500967] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:01:27,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:01:27,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 25 [2024-10-14 14:01:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61995191] [2024-10-14 14:01:27,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:01:27,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 14:01:27,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:27,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 14:01:27,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=516, Unknown=6, NotChecked=0, Total=600 [2024-10-14 14:01:27,513 INFO L87 Difference]: Start difference. First operand 386 states and 531 transitions. Second operand has 25 states, 21 states have (on average 5.619047619047619) internal successors, (118), 25 states have internal predecessors, (118), 9 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (30), 5 states have call predecessors, (30), 9 states have call successors, (30) [2024-10-14 14:01:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:29,639 INFO L93 Difference]: Finished difference Result 815 states and 1099 transitions. [2024-10-14 14:01:29,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 14:01:29,642 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 5.619047619047619) internal successors, (118), 25 states have internal predecessors, (118), 9 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (30), 5 states have call predecessors, (30), 9 states have call successors, (30) Word has length 103 [2024-10-14 14:01:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:29,644 INFO L225 Difference]: With dead ends: 815 [2024-10-14 14:01:29,644 INFO L226 Difference]: Without dead ends: 430 [2024-10-14 14:01:29,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=285, Invalid=1431, Unknown=6, NotChecked=0, Total=1722 [2024-10-14 14:01:29,645 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 587 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:29,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 951 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 14:01:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-10-14 14:01:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 345. [2024-10-14 14:01:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 312 states have (on average 1.3365384615384615) internal successors, (417), 314 states have internal predecessors, (417), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:01:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 465 transitions. [2024-10-14 14:01:29,667 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 465 transitions. Word has length 103 [2024-10-14 14:01:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:29,667 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 465 transitions. [2024-10-14 14:01:29,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 5.619047619047619) internal successors, (118), 25 states have internal predecessors, (118), 9 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (30), 5 states have call predecessors, (30), 9 states have call successors, (30) [2024-10-14 14:01:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 465 transitions. [2024-10-14 14:01:29,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 14:01:29,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:29,668 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:29,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 14:01:29,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 14:01:29,869 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:29,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:29,870 INFO L85 PathProgramCache]: Analyzing trace with hash -79816511, now seen corresponding path program 1 times [2024-10-14 14:01:29,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:29,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519715717] [2024-10-14 14:01:29,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:29,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:29,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288224904] [2024-10-14 14:01:29,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:29,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:29,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:29,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:29,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 14:01:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 14:01:30,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:30,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:30,196 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 29 treesize of output 31 [2024-10-14 14:01:30,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:30,401 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 51 treesize of output 19 [2024-10-14 14:01:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:30,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:30,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:30,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519715717] [2024-10-14 14:01:30,439 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:01:30,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288224904] [2024-10-14 14:01:30,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288224904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:30,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:30,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:01:30,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465773482] [2024-10-14 14:01:30,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:30,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:01:30,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:30,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:01:30,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:01:30,440 INFO L87 Difference]: Start difference. First operand 345 states and 465 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:31,461 INFO L93 Difference]: Finished difference Result 752 states and 1007 transitions. [2024-10-14 14:01:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:01:31,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-14 14:01:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:31,467 INFO L225 Difference]: With dead ends: 752 [2024-10-14 14:01:31,467 INFO L226 Difference]: Without dead ends: 408 [2024-10-14 14:01:31,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:01:31,468 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 201 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:31,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 789 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 14:01:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-14 14:01:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 345. [2024-10-14 14:01:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 312 states have (on average 1.3333333333333333) internal successors, (416), 314 states have internal predecessors, (416), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:01:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 464 transitions. [2024-10-14 14:01:31,488 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 464 transitions. Word has length 104 [2024-10-14 14:01:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:31,489 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 464 transitions. [2024-10-14 14:01:31,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 464 transitions. [2024-10-14 14:01:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 14:01:31,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:31,490 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:31,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 14:01:31,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 14:01:31,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:31,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:31,691 INFO L85 PathProgramCache]: Analyzing trace with hash 690574077, now seen corresponding path program 1 times [2024-10-14 14:01:31,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:31,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859829774] [2024-10-14 14:01:31,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:31,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:31,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271906442] [2024-10-14 14:01:31,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:31,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:31,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:31,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:31,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 14:01:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:31,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 14:01:31,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:31,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:31,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-10-14 14:01:31,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:31,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 14 [2024-10-14 14:01:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:31,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859829774] [2024-10-14 14:01:31,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:01:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271906442] [2024-10-14 14:01:31,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271906442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:31,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:31,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:01:31,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704899782] [2024-10-14 14:01:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:31,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:01:31,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:01:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:31,997 INFO L87 Difference]: Start difference. First operand 345 states and 464 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:32,260 INFO L93 Difference]: Finished difference Result 866 states and 1165 transitions. [2024-10-14 14:01:32,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:01:32,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-14 14:01:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:32,263 INFO L225 Difference]: With dead ends: 866 [2024-10-14 14:01:32,263 INFO L226 Difference]: Without dead ends: 522 [2024-10-14 14:01:32,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:01:32,264 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 68 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:32,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 470 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:01:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-10-14 14:01:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 360. [2024-10-14 14:01:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 329 states have internal predecessors, (438), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:01:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 486 transitions. [2024-10-14 14:01:32,284 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 486 transitions. Word has length 104 [2024-10-14 14:01:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:32,285 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 486 transitions. [2024-10-14 14:01:32,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 486 transitions. [2024-10-14 14:01:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 14:01:32,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:32,286 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:32,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 14:01:32,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:32,491 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:32,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash -330494277, now seen corresponding path program 1 times [2024-10-14 14:01:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:32,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165213540] [2024-10-14 14:01:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:32,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289340706] [2024-10-14 14:01:32,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:32,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:32,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:32,541 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:32,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 14:01:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:32,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-14 14:01:32,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:32,738 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 7 treesize of output 3 [2024-10-14 14:01:32,767 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-14 14:01:32,788 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-14 14:01:32,797 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-14 14:01:32,813 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-14 14:01:32,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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-14 14:01:32,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:32,932 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 65 [2024-10-14 14:01:33,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:33,082 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 68 [2024-10-14 14:01:33,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:33,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 31 [2024-10-14 14:01:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:33,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:33,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:33,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165213540] [2024-10-14 14:01:33,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:01:33,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289340706] [2024-10-14 14:01:33,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289340706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:33,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:33,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:01:33,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010325865] [2024-10-14 14:01:33,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:33,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 14:01:33,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:33,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 14:01:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 14:01:33,228 INFO L87 Difference]: Start difference. First operand 360 states and 486 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:34,319 INFO L93 Difference]: Finished difference Result 1068 states and 1447 transitions. [2024-10-14 14:01:34,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 14:01:34,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-14 14:01:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:34,323 INFO L225 Difference]: With dead ends: 1068 [2024-10-14 14:01:34,323 INFO L226 Difference]: Without dead ends: 709 [2024-10-14 14:01:34,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-14 14:01:34,325 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 252 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:34,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 802 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 14:01:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-10-14 14:01:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 435. [2024-10-14 14:01:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 388 states have (on average 1.3350515463917525) internal successors, (518), 390 states have internal predecessors, (518), 35 states have call successors, (35), 11 states have call predecessors, (35), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 14:01:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 588 transitions. [2024-10-14 14:01:34,354 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 588 transitions. Word has length 104 [2024-10-14 14:01:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:34,354 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 588 transitions. [2024-10-14 14:01:34,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 588 transitions. [2024-10-14 14:01:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 14:01:34,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:34,355 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:34,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 14:01:34,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 14:01:34,556 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:34,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:34,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1610357955, now seen corresponding path program 1 times [2024-10-14 14:01:34,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:34,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823136623] [2024-10-14 14:01:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:34,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:35,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:35,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823136623] [2024-10-14 14:01:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823136623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:35,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:35,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 14:01:35,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502925539] [2024-10-14 14:01:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:35,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 14:01:35,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:35,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 14:01:35,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-14 14:01:35,451 INFO L87 Difference]: Start difference. First operand 435 states and 588 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-14 14:01:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:36,761 INFO L93 Difference]: Finished difference Result 906 states and 1218 transitions. [2024-10-14 14:01:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 14:01:36,762 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 4 states have call successors, (11) Word has length 104 [2024-10-14 14:01:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:36,764 INFO L225 Difference]: With dead ends: 906 [2024-10-14 14:01:36,764 INFO L226 Difference]: Without dead ends: 547 [2024-10-14 14:01:36,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2024-10-14 14:01:36,765 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 396 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:36,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1294 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 14:01:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-14 14:01:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 435. [2024-10-14 14:01:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 388 states have (on average 1.3350515463917525) internal successors, (518), 390 states have internal predecessors, (518), 35 states have call successors, (35), 11 states have call predecessors, (35), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 14:01:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 588 transitions. [2024-10-14 14:01:36,795 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 588 transitions. Word has length 104 [2024-10-14 14:01:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:36,796 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 588 transitions. [2024-10-14 14:01:36,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-14 14:01:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 588 transitions. [2024-10-14 14:01:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 14:01:36,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:36,797 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:36,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 14:01:36,797 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:36,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash -163701519, now seen corresponding path program 1 times [2024-10-14 14:01:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:36,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893563455] [2024-10-14 14:01:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:36,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808894487] [2024-10-14 14:01:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:36,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:36,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:36,847 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:36,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 14:01:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:37,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-14 14:01:37,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:37,064 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 7 treesize of output 3 [2024-10-14 14:01:37,119 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-14 14:01:37,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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-14 14:01:37,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:37,203 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 64 treesize of output 60 [2024-10-14 14:01:37,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:37,304 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 79 treesize of output 63 [2024-10-14 14:01:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:37,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:37,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893563455] [2024-10-14 14:01:37,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:01:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808894487] [2024-10-14 14:01:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808894487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:37,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 14:01:37,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029097920] [2024-10-14 14:01:37,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:37,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:01:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:01:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:01:37,449 INFO L87 Difference]: Start difference. First operand 435 states and 588 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:38,363 INFO L93 Difference]: Finished difference Result 1072 states and 1451 transitions. [2024-10-14 14:01:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 14:01:38,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-14 14:01:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:38,367 INFO L225 Difference]: With dead ends: 1072 [2024-10-14 14:01:38,367 INFO L226 Difference]: Without dead ends: 713 [2024-10-14 14:01:38,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-14 14:01:38,371 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 250 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:38,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 658 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 14:01:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-10-14 14:01:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 453. [2024-10-14 14:01:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 406 states have (on average 1.3349753694581281) internal successors, (542), 408 states have internal predecessors, (542), 35 states have call successors, (35), 11 states have call predecessors, (35), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 14:01:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 612 transitions. [2024-10-14 14:01:38,401 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 612 transitions. Word has length 105 [2024-10-14 14:01:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:38,402 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 612 transitions. [2024-10-14 14:01:38,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:38,403 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 612 transitions. [2024-10-14 14:01:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 14:01:38,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:38,403 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:38,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 14:01:38,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:38,604 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:38,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1184769873, now seen corresponding path program 1 times [2024-10-14 14:01:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:38,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068975694] [2024-10-14 14:01:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:38,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981433714] [2024-10-14 14:01:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:38,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:38,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:38,663 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:38,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 14:01:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:38,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-14 14:01:38,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:38,860 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 7 treesize of output 3 [2024-10-14 14:01:39,014 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 14 [2024-10-14 14:01:39,054 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 14 [2024-10-14 14:01:39,106 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 14 [2024-10-14 14:01:39,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 14 [2024-10-14 14:01:39,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:39,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2024-10-14 14:01:39,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:39,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 38 [2024-10-14 14:01:39,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:39,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 20 [2024-10-14 14:01:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 118 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-14 14:01:39,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:01:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:39,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068975694] [2024-10-14 14:01:39,475 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:01:39,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981433714] [2024-10-14 14:01:39,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981433714] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 14:01:39,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 14:01:39,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-14 14:01:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958816616] [2024-10-14 14:01:39,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:39,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:01:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:39,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:01:39,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-14 14:01:39,476 INFO L87 Difference]: Start difference. First operand 453 states and 612 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:39,758 INFO L93 Difference]: Finished difference Result 814 states and 1098 transitions. [2024-10-14 14:01:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:01:39,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-14 14:01:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:39,763 INFO L225 Difference]: With dead ends: 814 [2024-10-14 14:01:39,764 INFO L226 Difference]: Without dead ends: 452 [2024-10-14 14:01:39,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-10-14 14:01:39,765 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 62 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:39,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 427 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:01:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-14 14:01:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 427. [2024-10-14 14:01:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 382 states have internal predecessors, (502), 35 states have call successors, (35), 11 states have call predecessors, (35), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 14:01:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 572 transitions. [2024-10-14 14:01:39,792 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 572 transitions. Word has length 105 [2024-10-14 14:01:39,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:39,793 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 572 transitions. [2024-10-14 14:01:39,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:39,793 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 572 transitions. [2024-10-14 14:01:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 14:01:39,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:39,794 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:39,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 14:01:39,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:39,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:39,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:39,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1792601743, now seen corresponding path program 1 times [2024-10-14 14:01:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465346222] [2024-10-14 14:01:39,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:40,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146929763] [2024-10-14 14:01:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:40,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:40,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:40,031 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:40,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 14:01:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:40,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-14 14:01:40,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:40,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:40,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 14:01:40,382 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 15 treesize of output 1 [2024-10-14 14:01:40,430 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 15 treesize of output 1 [2024-10-14 14:01:40,459 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 15 treesize of output 1 [2024-10-14 14:01:40,480 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 15 treesize of output 1 [2024-10-14 14:01:40,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2024-10-14 14:01:40,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:40,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 52 [2024-10-14 14:01:40,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:40,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 55 [2024-10-14 14:01:40,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:40,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 31 [2024-10-14 14:01:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:40,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:40,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:40,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465346222] [2024-10-14 14:01:40,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:01:40,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146929763] [2024-10-14 14:01:40,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146929763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:40,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:40,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 14:01:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750100096] [2024-10-14 14:01:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:40,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:01:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:40,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:01:40,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:01:40,839 INFO L87 Difference]: Start difference. First operand 427 states and 572 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:41,812 INFO L93 Difference]: Finished difference Result 1069 states and 1436 transitions. [2024-10-14 14:01:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 14:01:41,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-14 14:01:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:41,817 INFO L225 Difference]: With dead ends: 1069 [2024-10-14 14:01:41,817 INFO L226 Difference]: Without dead ends: 711 [2024-10-14 14:01:41,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:01:41,818 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 180 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:41,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 644 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 14:01:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-14 14:01:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 449. [2024-10-14 14:01:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 401 states have (on average 1.319201995012469) internal successors, (529), 403 states have internal predecessors, (529), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 14:01:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 599 transitions. [2024-10-14 14:01:41,844 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 599 transitions. Word has length 105 [2024-10-14 14:01:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:41,844 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 599 transitions. [2024-10-14 14:01:41,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 599 transitions. [2024-10-14 14:01:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 14:01:41,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:41,845 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:41,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 14:01:42,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-14 14:01:42,046 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:42,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:42,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1409264556, now seen corresponding path program 1 times [2024-10-14 14:01:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140637129] [2024-10-14 14:01:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140637129] [2024-10-14 14:01:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140637129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:01:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723043976] [2024-10-14 14:01:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:42,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:01:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:42,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:01:42,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:01:42,338 INFO L87 Difference]: Start difference. First operand 449 states and 599 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:42,720 INFO L93 Difference]: Finished difference Result 957 states and 1278 transitions. [2024-10-14 14:01:42,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:01:42,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-14 14:01:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:42,723 INFO L225 Difference]: With dead ends: 957 [2024-10-14 14:01:42,723 INFO L226 Difference]: Without dead ends: 599 [2024-10-14 14:01:42,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:01:42,725 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 103 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:42,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 534 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:01:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-10-14 14:01:42,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 482. [2024-10-14 14:01:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 434 states have (on average 1.3133640552995391) internal successors, (570), 436 states have internal predecessors, (570), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 14:01:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 640 transitions. [2024-10-14 14:01:42,750 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 640 transitions. Word has length 105 [2024-10-14 14:01:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:42,751 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 640 transitions. [2024-10-14 14:01:42,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 640 transitions. [2024-10-14 14:01:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 14:01:42,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:42,752 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:42,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 14:01:42,752 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:42,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:42,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1944836350, now seen corresponding path program 1 times [2024-10-14 14:01:42,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:42,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225267499] [2024-10-14 14:01:42,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:42,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225267499] [2024-10-14 14:01:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225267499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:42,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:01:42,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999812107] [2024-10-14 14:01:42,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:42,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:01:42,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:42,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:01:42,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:01:42,812 INFO L87 Difference]: Start difference. First operand 482 states and 640 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:42,851 INFO L93 Difference]: Finished difference Result 863 states and 1152 transitions. [2024-10-14 14:01:42,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:01:42,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-14 14:01:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:42,854 INFO L225 Difference]: With dead ends: 863 [2024-10-14 14:01:42,854 INFO L226 Difference]: Without dead ends: 472 [2024-10-14 14:01:42,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:01:42,855 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:42,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:42,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-10-14 14:01:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2024-10-14 14:01:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 424 states have (on average 1.3089622641509433) internal successors, (555), 426 states have internal predecessors, (555), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 14:01:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 625 transitions. [2024-10-14 14:01:42,884 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 625 transitions. Word has length 105 [2024-10-14 14:01:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:42,884 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 625 transitions. [2024-10-14 14:01:42,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 625 transitions. [2024-10-14 14:01:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 14:01:42,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:42,886 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:42,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 14:01:42,886 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:42,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:42,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2028240427, now seen corresponding path program 1 times [2024-10-14 14:01:42,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:42,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142535239] [2024-10-14 14:01:42,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:42,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:01:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:01:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:01:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:43,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:43,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142535239] [2024-10-14 14:01:43,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142535239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:43,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:43,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:01:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822235165] [2024-10-14 14:01:43,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:43,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:01:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:43,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:01:43,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:43,342 INFO L87 Difference]: Start difference. First operand 472 states and 625 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:43,562 INFO L93 Difference]: Finished difference Result 878 states and 1169 transitions. [2024-10-14 14:01:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:01:43,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-14 14:01:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:43,565 INFO L225 Difference]: With dead ends: 878 [2024-10-14 14:01:43,565 INFO L226 Difference]: Without dead ends: 491 [2024-10-14 14:01:43,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-14 14:01:43,566 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 118 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:43,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 340 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:01:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-14 14:01:43,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 454. [2024-10-14 14:01:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 406 states have (on average 1.293103448275862) internal successors, (525), 408 states have internal predecessors, (525), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 14:01:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 595 transitions. [2024-10-14 14:01:43,604 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 595 transitions. Word has length 105 [2024-10-14 14:01:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:43,604 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 595 transitions. [2024-10-14 14:01:43,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 595 transitions. [2024-10-14 14:01:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 14:01:43,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:43,605 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:43,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 14:01:43,605 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:43,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:43,606 INFO L85 PathProgramCache]: Analyzing trace with hash -141069265, now seen corresponding path program 1 times [2024-10-14 14:01:43,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:43,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441724379] [2024-10-14 14:01:43,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:43,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:43,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845141340] [2024-10-14 14:01:43,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:43,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:43,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:43,649 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:43,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 14:01:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:43,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 14:01:43,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:43,899 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-14 14:01:43,904 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-14 14:01:43,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:43,934 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 53 treesize of output 52 [2024-10-14 14:01:44,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:44,024 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 68 treesize of output 55 [2024-10-14 14:01:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:44,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:44,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:44,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441724379] [2024-10-14 14:01:44,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:01:44,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845141340] [2024-10-14 14:01:44,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845141340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:44,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:44,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:01:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656795923] [2024-10-14 14:01:44,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:44,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:01:44,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:01:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:01:44,082 INFO L87 Difference]: Start difference. First operand 454 states and 595 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:44,453 INFO L93 Difference]: Finished difference Result 858 states and 1125 transitions. [2024-10-14 14:01:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:01:44,454 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-14 14:01:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:44,456 INFO L225 Difference]: With dead ends: 858 [2024-10-14 14:01:44,456 INFO L226 Difference]: Without dead ends: 495 [2024-10-14 14:01:44,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:01:44,457 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 172 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:44,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 414 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:01:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-14 14:01:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 446. [2024-10-14 14:01:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 399 states have (on average 1.2882205513784462) internal successors, (514), 401 states have internal predecessors, (514), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 14:01:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 580 transitions. [2024-10-14 14:01:44,484 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 580 transitions. Word has length 105 [2024-10-14 14:01:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:44,485 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 580 transitions. [2024-10-14 14:01:44,485 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 580 transitions. [2024-10-14 14:01:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 14:01:44,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:44,486 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:44,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-14 14:01:44,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-14 14:01:44,687 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:44,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:44,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1478767653, now seen corresponding path program 1 times [2024-10-14 14:01:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:44,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379722705] [2024-10-14 14:01:44,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:01:44,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102235090] [2024-10-14 14:01:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:44,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:44,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:44,730 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:44,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 14:01:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:01:45,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 14:01:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:01:45,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 14:01:45,228 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 14:01:45,228 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 14:01:45,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-14 14:01:45,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 14:01:45,436 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 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-14 14:01:45,490 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 14:01:45,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:01:45 BoogieIcfgContainer [2024-10-14 14:01:45,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 14:01:45,493 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 14:01:45,493 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 14:01:45,493 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 14:01:45,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:01:13" (3/4) ... [2024-10-14 14:01:45,496 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 14:01:45,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 14:01:45,497 INFO L158 Benchmark]: Toolchain (without parser) took 33064.53ms. Allocated memory was 163.6MB in the beginning and 453.0MB in the end (delta: 289.4MB). Free memory was 103.9MB in the beginning and 168.2MB in the end (delta: -64.3MB). Peak memory consumption was 225.5MB. Max. memory is 16.1GB. [2024-10-14 14:01:45,497 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:01:45,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.04ms. Allocated memory is still 163.6MB. Free memory was 103.4MB in the beginning and 131.5MB in the end (delta: -28.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 14:01:45,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.95ms. Allocated memory is still 163.6MB. Free memory was 131.5MB in the beginning and 126.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 14:01:45,498 INFO L158 Benchmark]: Boogie Preprocessor took 92.75ms. Allocated memory is still 163.6MB. Free memory was 126.7MB in the beginning and 121.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 14:01:45,498 INFO L158 Benchmark]: RCFGBuilder took 660.75ms. Allocated memory is still 163.6MB. Free memory was 121.3MB in the beginning and 83.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-14 14:01:45,498 INFO L158 Benchmark]: TraceAbstraction took 31925.47ms. Allocated memory was 163.6MB in the beginning and 453.0MB in the end (delta: 289.4MB). Free memory was 82.7MB in the beginning and 168.2MB in the end (delta: -85.5MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. [2024-10-14 14:01:45,498 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 453.0MB. Free memory is still 168.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:01:45,499 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.04ms. Allocated memory is still 163.6MB. Free memory was 103.4MB in the beginning and 131.5MB in the end (delta: -28.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.95ms. Allocated memory is still 163.6MB. Free memory was 131.5MB in the beginning and 126.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.75ms. Allocated memory is still 163.6MB. Free memory was 126.7MB in the beginning and 121.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 660.75ms. Allocated memory is still 163.6MB. Free memory was 121.3MB in the beginning and 83.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31925.47ms. Allocated memory was 163.6MB in the beginning and 453.0MB in the end (delta: 289.4MB). Free memory was 82.7MB in the beginning and 168.2MB in the end (delta: -85.5MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 453.0MB. Free memory is still 168.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of bitwiseOr at line 69. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L51] unsigned short int last_1_WrapperStruct00_var_1_1 = 128; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] EXPR WrapperStruct00.var_1_1 [L103] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L84] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L94] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_10 [L95] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_10 [L95] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L96] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_11 [L97] EXPR WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] EXPR WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_11 [L97] EXPR WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] EXPR (WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] EXPR (WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L98] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L99] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L114] RET updateVariables() [L115] CALL step() [L55] WrapperStruct00.var_1_14 = 200 [L56] EXPR WrapperStruct00.var_1_16 [L56] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L57] EXPR WrapperStruct00.var_1_10 [L57] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_10 [L58] EXPR WrapperStruct00.var_1_3 [L58] EXPR WrapperStruct00.var_1_4 [L58] signed long int stepLocal_0 = WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4; [L59] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L59] COND FALSE !(WrapperStruct00.var_1_2) [L62] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L62] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) [L62] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_0=0] [L62] COND TRUE stepLocal_0 >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)))) [L63] EXPR WrapperStruct00.var_1_4 [L63] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_4 [L68] EXPR WrapperStruct00.var_1_3 [L68] EXPR WrapperStruct00.var_1_1 [L68] signed long int stepLocal_2 = WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1; [L69] EXPR WrapperStruct00.var_1_14 [L69] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L69] EXPR WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_2=3] [L69] signed long int stepLocal_1 = WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15; [L70] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L70] COND FALSE !(WrapperStruct00.var_1_15 <= stepLocal_2) [L77] EXPR WrapperStruct00.var_1_10 [L77] WrapperStruct00.var_1_8 = WrapperStruct00.var_1_10 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L79] COND FALSE !(WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3))) [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) [L106] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)) [L106] EXPR WrapperStruct00.var_1_1 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR ((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10))) [L106] EXPR WrapperStruct00.var_1_15 [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)) [L106] EXPR WrapperStruct00.var_1_8 [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR (WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_17 == ((double) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_17 == ((double) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106-L107] return (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_17 == ((double) WrapperStruct00.var_1_10)) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.8s, OverallIterations: 26, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3539 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3535 mSDsluCounter, 12600 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9354 mSDsCounter, 461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10968 IncrementalHoareTripleChecker+Invalid, 11429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 461 mSolverCounterUnsat, 3246 mSDtfsCounter, 10968 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1777 SyntacticMatches, 2 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=22, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 1760 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 4039 NumberOfCodeBlocks, 4039 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2965 ConstructedInterpolants, 15 QuantifiedInterpolants, 16030 SizeOfPredicates, 63 NumberOfNonLiveVariables, 4268 ConjunctsInSsa, 312 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 6302/6380 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-14 14:01:45,612 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-83.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 e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:01:47,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:01:47,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 14:01:47,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:01:47,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:01:47,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:01:47,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:01:47,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:01:47,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:01:47,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:01:47,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:01:47,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:01:47,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:01:47,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:01:47,643 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:01:47,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:01:47,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:01:47,644 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:01:47,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:01:47,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:01:47,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:01:47,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:01:47,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:01:47,649 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 14:01:47,649 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 14:01:47,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:01:47,649 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 14:01:47,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:01:47,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:01:47,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:01:47,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:01:47,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:01:47,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:01:47,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:01:47,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:01:47,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:01:47,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:01:47,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:01:47,651 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 14:01:47,651 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 14:01:47,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:01:47,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:01:47,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:01:47,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:01:47,654 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 14:01:47,655 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 -> e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 [2024-10-14 14:01:47,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:01:47,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:01:47,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:01:47,985 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:01:47,986 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:01:47,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-10-14 14:01:49,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:01:49,565 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:01:49,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-10-14 14:01:49,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a42766f0/3bf5174aae7e429997c690aa09989bb1/FLAGcc584510d [2024-10-14 14:01:49,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a42766f0/3bf5174aae7e429997c690aa09989bb1 [2024-10-14 14:01:49,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:01:49,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:01:49,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:01:49,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:01:49,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:01:49,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:49,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d279bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49, skipping insertion in model container [2024-10-14 14:01:49,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:49,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:01:49,799 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-83.i[916,929] [2024-10-14 14:01:49,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:01:49,886 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:01:49,897 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-83.i[916,929] [2024-10-14 14:01:49,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:01:49,970 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:01:49,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49 WrapperNode [2024-10-14 14:01:49,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:01:49,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:01:49,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:01:49,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:01:49,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,042 INFO L138 Inliner]: procedures = 33, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-10-14 14:01:50,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:01:50,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:01:50,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:01:50,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:01:50,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,080 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-14 14:01:50,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:01:50,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:01:50,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:01:50,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:01:50,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (1/1) ... [2024-10-14 14:01:50,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:01:50,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:50,152 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-14 14:01:50,157 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-14 14:01:50,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 14:01:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 14:01:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:01:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:01:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:01:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:01:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 14:01:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 14:01:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 14:01:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 14:01:50,282 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:01:50,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:01:51,113 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-14 14:01:51,113 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:01:51,145 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:01:51,145 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:01:51,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:01:51 BoogieIcfgContainer [2024-10-14 14:01:51,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:01:51,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:01:51,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:01:51,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:01:51,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:01:49" (1/3) ... [2024-10-14 14:01:51,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ced697a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:01:51, skipping insertion in model container [2024-10-14 14:01:51,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:49" (2/3) ... [2024-10-14 14:01:51,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ced697a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:01:51, skipping insertion in model container [2024-10-14 14:01:51,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:01:51" (3/3) ... [2024-10-14 14:01:51,174 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-83.i [2024-10-14 14:01:51,187 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:01:51,188 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:01:51,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:01:51,240 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;@7202f835, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:01:51,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:01:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 83 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:01:51,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:51,256 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:51,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:51,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:51,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1157573802, now seen corresponding path program 1 times [2024-10-14 14:01:51,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:51,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630254249] [2024-10-14 14:01:51,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:51,271 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-14 14:01:51,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:51,274 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-14 14:01:51,278 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-14 14:01:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:51,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 14:01:51,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-14 14:01:51,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:51,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630254249] [2024-10-14 14:01:51,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630254249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:51,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:51,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:01:51,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436030991] [2024-10-14 14:01:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:51,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:01:51,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:51,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:01:51,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:01:51,610 INFO L87 Difference]: Start difference. First operand has 96 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 83 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:51,655 INFO L93 Difference]: Finished difference Result 189 states and 297 transitions. [2024-10-14 14:01:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:01:51,657 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-14 14:01:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:51,667 INFO L225 Difference]: With dead ends: 189 [2024-10-14 14:01:51,667 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 14:01:51,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-14 14:01:51,673 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-14 14:01:51,673 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-14 14:01:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 14:01:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 14:01:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2024-10-14 14:01:51,710 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 99 [2024-10-14 14:01:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:51,710 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2024-10-14 14:01:51,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2024-10-14 14:01:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:01:51,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:51,713 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:51,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 14:01:51,914 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-14 14:01:51,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1482080892, now seen corresponding path program 1 times [2024-10-14 14:01:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:51,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084993814] [2024-10-14 14:01:51,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:51,916 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-14 14:01:51,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:51,919 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-14 14:01:51,921 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-14 14:01:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:52,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 14:01:52,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-14 14:01:52,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:52,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:52,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084993814] [2024-10-14 14:01:52,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084993814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:52,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:52,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:01:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366491725] [2024-10-14 14:01:52,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:52,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:01:52,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:52,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:01:52,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:52,223 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:52,320 INFO L93 Difference]: Finished difference Result 189 states and 268 transitions. [2024-10-14 14:01:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:01:52,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-10-14 14:01:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:52,322 INFO L225 Difference]: With dead ends: 189 [2024-10-14 14:01:52,322 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 14:01:52,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 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-14 14:01:52,323 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:52,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:01:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 14:01:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-14 14:01:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-14 14:01:52,334 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 99 [2024-10-14 14:01:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:52,335 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-14 14:01:52,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:01:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-14 14:01:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:01:52,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:52,337 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:52,348 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-14 14:01:52,538 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-14 14:01:52,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:52,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash -446191810, now seen corresponding path program 1 times [2024-10-14 14:01:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:52,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806075293] [2024-10-14 14:01:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:52,539 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-14 14:01:52,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:52,542 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-14 14:01:52,543 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-14 14:01:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:52,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 14:01:52,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:52,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:52,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:52,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806075293] [2024-10-14 14:01:52,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806075293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:52,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:52,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:01:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141967072] [2024-10-14 14:01:52,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:52,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:01:52,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:52,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:01:52,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:01:52,850 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:52,957 INFO L93 Difference]: Finished difference Result 196 states and 276 transitions. [2024-10-14 14:01:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:01:52,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-14 14:01:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:52,960 INFO L225 Difference]: With dead ends: 196 [2024-10-14 14:01:52,960 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 14:01:52,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-14 14:01:52,961 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-14 14:01:52,961 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-14 14:01:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 14:01:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-14 14:01:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-14 14:01:52,968 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 99 [2024-10-14 14:01:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:52,969 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-14 14:01:52,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-14 14:01:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:01:52,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:52,971 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:52,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 14:01:53,171 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-14 14:01:53,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1255538436, now seen corresponding path program 1 times [2024-10-14 14:01:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:53,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186603113] [2024-10-14 14:01:53,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:53,176 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-14 14:01:53,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:53,178 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-14 14:01:53,179 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-14 14:01:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:53,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 14:01:53,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:53,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:53,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186603113] [2024-10-14 14:01:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186603113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:53,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:01:53,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766222836] [2024-10-14 14:01:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:01:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:01:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:53,487 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:53,595 INFO L93 Difference]: Finished difference Result 202 states and 281 transitions. [2024-10-14 14:01:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:01:53,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-14 14:01:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:53,597 INFO L225 Difference]: With dead ends: 202 [2024-10-14 14:01:53,597 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 14:01:53,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 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-14 14:01:53,599 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-14 14:01:53,602 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-14 14:01:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 14:01:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-10-14 14:01:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2024-10-14 14:01:53,612 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 99 [2024-10-14 14:01:53,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:53,612 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2024-10-14 14:01:53,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2024-10-14 14:01:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:01:53,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:53,614 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:53,625 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-14 14:01:53,815 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-14 14:01:53,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:53,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1198280134, now seen corresponding path program 1 times [2024-10-14 14:01:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:53,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983014934] [2024-10-14 14:01:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:53,816 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-14 14:01:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:53,819 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-14 14:01:53,820 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-14 14:01:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:54,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 14:01:54,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:54,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:54,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:54,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983014934] [2024-10-14 14:01:54,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983014934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:54,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:54,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:01:54,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943050884] [2024-10-14 14:01:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:54,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:01:54,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:54,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:01:54,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:01:54,104 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:54,221 INFO L93 Difference]: Finished difference Result 206 states and 285 transitions. [2024-10-14 14:01:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:01:54,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-14 14:01:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:54,223 INFO L225 Difference]: With dead ends: 206 [2024-10-14 14:01:54,223 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 14:01:54,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 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-14 14:01:54,224 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-14 14:01:54,224 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-14 14:01:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 14:01:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-14 14:01:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:01:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2024-10-14 14:01:54,230 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 99 [2024-10-14 14:01:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:54,230 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2024-10-14 14:01:54,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2024-10-14 14:01:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:01:54,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:54,232 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:54,243 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-14 14:01:54,432 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-14 14:01:54,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:54,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1198220552, now seen corresponding path program 1 times [2024-10-14 14:01:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785124582] [2024-10-14 14:01:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:54,434 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-14 14:01:54,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:54,435 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-14 14:01:54,437 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-14 14:01:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:54,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 14:01:54,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:54,880 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 17 treesize of output 9 [2024-10-14 14:01:55,021 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-14 14:01:55,072 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 24 [2024-10-14 14:01:55,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:55,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 28 [2024-10-14 14:01:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:55,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:55,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:55,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785124582] [2024-10-14 14:01:55,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785124582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:55,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:55,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:01:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850732838] [2024-10-14 14:01:55,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:55,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:01:55,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:01:55,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:01:55,180 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:57,231 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2024-10-14 14:01:57,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 14:01:57,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-14 14:01:57,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:57,234 INFO L225 Difference]: With dead ends: 405 [2024-10-14 14:01:57,235 INFO L226 Difference]: Without dead ends: 302 [2024-10-14 14:01:57,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:01:57,238 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 239 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:57,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 661 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 14:01:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-14 14:01:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 148. [2024-10-14 14:01:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 123 states have internal predecessors, (162), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:01:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 206 transitions. [2024-10-14 14:01:57,270 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 206 transitions. Word has length 99 [2024-10-14 14:01:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:57,271 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 206 transitions. [2024-10-14 14:01:57,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:01:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 206 transitions. [2024-10-14 14:01:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:01:57,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:57,272 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:57,286 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 (7)] Forceful destruction successful, exit code 0 [2024-10-14 14:01:57,472 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-14 14:01:57,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:57,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1332234058, now seen corresponding path program 1 times [2024-10-14 14:01:57,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:57,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936275064] [2024-10-14 14:01:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:57,474 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-14 14:01:57,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:57,476 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-14 14:01:57,477 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-14 14:01:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:57,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 14:01:57,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:57,808 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 17 treesize of output 9 [2024-10-14 14:01:57,913 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-14 14:01:57,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:57,956 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 38 [2024-10-14 14:01:58,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:58,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2024-10-14 14:01:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:01:58,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:58,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:58,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936275064] [2024-10-14 14:01:58,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936275064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:58,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:58,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:01:58,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277358715] [2024-10-14 14:01:58,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:58,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:01:58,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:58,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:01:58,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:01:58,094 INFO L87 Difference]: Start difference. First operand 148 states and 206 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:02:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:00,928 INFO L93 Difference]: Finished difference Result 364 states and 498 transitions. [2024-10-14 14:02:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:02:00,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-14 14:02:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:00,932 INFO L225 Difference]: With dead ends: 364 [2024-10-14 14:02:00,933 INFO L226 Difference]: Without dead ends: 261 [2024-10-14 14:02:00,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:02:00,934 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 223 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:00,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 377 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 14:02:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-14 14:02:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 165. [2024-10-14 14:02:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:02:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 229 transitions. [2024-10-14 14:02:00,954 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 229 transitions. Word has length 99 [2024-10-14 14:02:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:00,954 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 229 transitions. [2024-10-14 14:02:00,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:02:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 229 transitions. [2024-10-14 14:02:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:02:00,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:00,956 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:00,975 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-14 14:02:01,163 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-14 14:02:01,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:01,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:01,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1941664884, now seen corresponding path program 1 times [2024-10-14 14:02:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075481591] [2024-10-14 14:02:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:01,166 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-14 14:02:01,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:01,169 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-14 14:02:01,170 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-14 14:02:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:01,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 14:02:01,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:01,591 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-14 14:02:01,672 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 33 treesize of output 36 [2024-10-14 14:02:05,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:05,650 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 53 treesize of output 62 [2024-10-14 14:02:12,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:12,070 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 67 treesize of output 78 [2024-10-14 14:02:12,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:12,519 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 105 treesize of output 101 [2024-10-14 14:02:12,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:12,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 98 treesize of output 107 [2024-10-14 14:02:12,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:12,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 113 treesize of output 107 [2024-10-14 14:02:12,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:12,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 93 treesize of output 39 [2024-10-14 14:02:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 138 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-14 14:02:13,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:02:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:02:13,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:13,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075481591] [2024-10-14 14:02:13,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075481591] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 14:02:13,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 14:02:13,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2024-10-14 14:02:13,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301425513] [2024-10-14 14:02:13,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:13,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:02:13,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:13,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:02:13,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=118, Unknown=3, NotChecked=0, Total=156 [2024-10-14 14:02:13,411 INFO L87 Difference]: Start difference. First operand 165 states and 229 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:02:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:13,542 INFO L93 Difference]: Finished difference Result 269 states and 373 transitions. [2024-10-14 14:02:13,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:02:13,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-14 14:02:13,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:13,546 INFO L225 Difference]: With dead ends: 269 [2024-10-14 14:02:13,546 INFO L226 Difference]: Without dead ends: 166 [2024-10-14 14:02:13,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=35, Invalid=118, Unknown=3, NotChecked=0, Total=156 [2024-10-14 14:02:13,547 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:13,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:02:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-14 14:02:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-14 14:02:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 141 states have internal predecessors, (186), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:02:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2024-10-14 14:02:13,558 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 99 [2024-10-14 14:02:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:13,561 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2024-10-14 14:02:13,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:02:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2024-10-14 14:02:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:02:13,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:13,562 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:13,575 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-14 14:02:13,765 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-14 14:02:13,765 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:13,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:13,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1073438734, now seen corresponding path program 1 times [2024-10-14 14:02:13,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:13,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519441122] [2024-10-14 14:02:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:13,766 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-14 14:02:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:13,768 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-14 14:02:13,769 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-14 14:02:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:14,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 14:02:14,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:14,071 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-14 14:02:14,075 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 20 treesize of output 21 [2024-10-14 14:02:17,639 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|) (select .cse0 (bvadd (_ bv14 32) |c_~#WrapperStruct00~0.offset|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|) (select .cse0 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))))) is different from true [2024-10-14 14:02:17,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:17,705 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 47 [2024-10-14 14:02:21,000 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (and (exists ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_74|) (select .cse0 (bvadd (_ bv22 32) |c_~#WrapperStruct00~0.offset|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|) (select .cse0 (bvadd (_ bv26 32) |c_~#WrapperStruct00~0.offset|))))) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|) (select .cse0 (bvadd (_ bv14 32) |c_~#WrapperStruct00~0.offset|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|) (select .cse0 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|))))))) is different from true [2024-10-14 14:02:21,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:21,124 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 60 treesize of output 53 [2024-10-14 14:02:21,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:21,309 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 78 treesize of output 83 [2024-10-14 14:02:21,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:21,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 91 treesize of output 111 [2024-10-14 14:02:21,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:21,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 128 treesize of output 154 [2024-10-14 14:02:22,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:22,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 174 treesize of output 80 [2024-10-14 14:02:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 12 not checked. [2024-10-14 14:02:22,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:02:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:02:22,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:22,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519441122] [2024-10-14 14:02:22,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519441122] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 14:02:22,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 14:02:22,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 16 [2024-10-14 14:02:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122048124] [2024-10-14 14:02:22,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:22,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 14:02:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:22,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 14:02:22,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=141, Unknown=2, NotChecked=50, Total=240 [2024-10-14 14:02:22,403 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:02:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:24,033 INFO L93 Difference]: Finished difference Result 356 states and 485 transitions. [2024-10-14 14:02:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:02:24,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-14 14:02:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:24,036 INFO L225 Difference]: With dead ends: 356 [2024-10-14 14:02:24,036 INFO L226 Difference]: Without dead ends: 252 [2024-10-14 14:02:24,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=65, Invalid=213, Unknown=2, NotChecked=62, Total=342 [2024-10-14 14:02:24,037 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 80 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:24,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 615 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 14:02:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-14 14:02:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2024-10-14 14:02:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 218 states have (on average 1.31651376146789) internal successors, (287), 219 states have internal predecessors, (287), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 14:02:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 339 transitions. [2024-10-14 14:02:24,046 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 339 transitions. Word has length 99 [2024-10-14 14:02:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:24,046 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 339 transitions. [2024-10-14 14:02:24,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:02:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 339 transitions. [2024-10-14 14:02:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 14:02:24,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:24,047 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:24,061 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 (10)] Forceful destruction successful, exit code 0 [2024-10-14 14:02:24,247 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-14 14:02:24,248 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:24,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1416090228, now seen corresponding path program 1 times [2024-10-14 14:02:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:24,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695662450] [2024-10-14 14:02:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:24,249 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-14 14:02:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:24,250 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-14 14:02:24,251 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-14 14:02:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:24,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 14:02:24,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:24,595 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-14 14:02:24,664 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 43 treesize of output 16 [2024-10-14 14:02:24,687 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 38 treesize of output 26 [2024-10-14 14:02:27,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:27,155 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 39 [2024-10-14 14:02:27,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:27,326 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 54 treesize of output 24 [2024-10-14 14:02:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 138 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-14 14:02:27,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:02:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:02:27,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695662450] [2024-10-14 14:02:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695662450] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 14:02:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 14:02:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-10-14 14:02:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395541670] [2024-10-14 14:02:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:27,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:02:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:02:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=103, Unknown=1, NotChecked=0, Total=132 [2024-10-14 14:02:27,931 INFO L87 Difference]: Start difference. First operand 249 states and 339 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:02:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:28,100 INFO L93 Difference]: Finished difference Result 441 states and 603 transitions. [2024-10-14 14:02:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:02:28,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-14 14:02:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:28,105 INFO L225 Difference]: With dead ends: 441 [2024-10-14 14:02:28,105 INFO L226 Difference]: Without dead ends: 260 [2024-10-14 14:02:28,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=33, Invalid=122, Unknown=1, NotChecked=0, Total=156 [2024-10-14 14:02:28,106 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 25 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:28,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 394 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:02:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-14 14:02:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 250. [2024-10-14 14:02:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3105022831050228) internal successors, (287), 220 states have internal predecessors, (287), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 14:02:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 339 transitions. [2024-10-14 14:02:28,124 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 339 transitions. Word has length 99 [2024-10-14 14:02:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:28,124 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 339 transitions. [2024-10-14 14:02:28,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:02:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 339 transitions. [2024-10-14 14:02:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 14:02:28,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:28,126 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:28,138 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 (11)] Ended with exit code 0 [2024-10-14 14:02:28,326 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-14 14:02:28,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:28,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1167372280, now seen corresponding path program 1 times [2024-10-14 14:02:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:28,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077116134] [2024-10-14 14:02:28,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:28,328 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-14 14:02:28,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:28,329 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-14 14:02:28,329 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-14 14:02:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:28,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 14:02:28,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:28,802 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 17 treesize of output 9 [2024-10-14 14:02:28,854 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-14 14:02:28,961 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 33 treesize of output 36 [2024-10-14 14:02:33,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:33,143 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 53 treesize of output 62