./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/array-fpi/brs2.c --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/array-fpi/brs2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc354f47e1cc26b26f82415b2113a1e937a24cebf9ecb225fe7f6242be1c8136 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 22:34:30,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 22:34:30,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 22:34:30,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 22:34:30,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 22:34:30,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 22:34:30,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 22:34:30,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 22:34:30,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 22:34:30,183 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 22:34:30,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 22:34:30,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 22:34:30,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 22:34:30,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 22:34:30,186 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 22:34:30,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 22:34:30,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 22:34:30,187 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 22:34:30,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 22:34:30,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 22:34:30,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 22:34:30,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 22:34:30,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 22:34:30,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 22:34:30,188 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 22:34:30,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 22:34:30,189 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 22:34:30,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 22:34:30,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 22:34:30,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 22:34:30,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 22:34:30,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:34:30,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 22:34:30,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 22:34:30,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 22:34:30,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 22:34:30,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 22:34:30,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 22:34:30,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 22:34:30,192 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 22:34:30,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 22:34:30,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 22:34:30,192 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 -> fc354f47e1cc26b26f82415b2113a1e937a24cebf9ecb225fe7f6242be1c8136 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 22:34:30,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 22:34:30,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 22:34:30,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 22:34:30,406 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 22:34:30,406 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 22:34:30,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs2.c [2023-11-22 22:34:31,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 22:34:31,544 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 22:34:31,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2.c [2023-11-22 22:34:31,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e4473aa/3fe9a470ad9143a7b632c3d4e8550ec4/FLAG23d97987e [2023-11-22 22:34:31,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e4473aa/3fe9a470ad9143a7b632c3d4e8550ec4 [2023-11-22 22:34:31,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 22:34:31,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 22:34:31,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 22:34:31,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 22:34:31,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 22:34:31,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fc5bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31, skipping insertion in model container [2023-11-22 22:34:31,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,587 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 22:34:31,685 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2.c[587,600] [2023-11-22 22:34:31,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:34:31,704 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 22:34:31,713 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2.c[587,600] [2023-11-22 22:34:31,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:34:31,727 INFO L206 MainTranslator]: Completed translation [2023-11-22 22:34:31,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31 WrapperNode [2023-11-22 22:34:31,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 22:34:31,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 22:34:31,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 22:34:31,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 22:34:31,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,764 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2023-11-22 22:34:31,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 22:34:31,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 22:34:31,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 22:34:31,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 22:34:31,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,777 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,792 INFO L189 HeapSplitter]: Split 16 memory accesses to 4 slices as follows [2, 7, 4, 3] [2023-11-22 22:34:31,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 22:34:31,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 22:34:31,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 22:34:31,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 22:34:31,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (1/1) ... [2023-11-22 22:34:31,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:34:31,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:34:31,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 22:34:31,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 22:34:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 22:34:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 22:34:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 22:34:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-22 22:34:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-22 22:34:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 22:34:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 22:34:31,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 22:34:31,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-22 22:34:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-22 22:34:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 22:34:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 22:34:31,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 22:34:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 22:34:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 22:34:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-22 22:34:31,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-22 22:34:31,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 22:34:31,943 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 22:34:31,947 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 22:34:32,063 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 22:34:32,078 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 22:34:32,078 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 22:34:32,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:34:32 BoogieIcfgContainer [2023-11-22 22:34:32,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 22:34:32,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 22:34:32,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 22:34:32,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 22:34:32,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:34:31" (1/3) ... [2023-11-22 22:34:32,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be6b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:34:32, skipping insertion in model container [2023-11-22 22:34:32,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:31" (2/3) ... [2023-11-22 22:34:32,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be6b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:34:32, skipping insertion in model container [2023-11-22 22:34:32,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:34:32" (3/3) ... [2023-11-22 22:34:32,085 INFO L112 eAbstractionObserver]: Analyzing ICFG brs2.c [2023-11-22 22:34:32,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 22:34:32,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 22:34:32,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 22:34:32,131 INFO L357 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, mHoare=true, 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;@5c81f2f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 22:34:32,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 22:34:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 22:34:32,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:32,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:32,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:32,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1256235845, now seen corresponding path program 1 times [2023-11-22 22:34:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:32,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092706558] [2023-11-22 22:34:32,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:32,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:32,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092706558] [2023-11-22 22:34:32,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092706558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:34:32,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:34:32,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 22:34:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265887296] [2023-11-22 22:34:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:34:32,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 22:34:32,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 22:34:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 22:34:32,311 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:32,325 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2023-11-22 22:34:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 22:34:32,327 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-22 22:34:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:32,332 INFO L225 Difference]: With dead ends: 33 [2023-11-22 22:34:32,332 INFO L226 Difference]: Without dead ends: 15 [2023-11-22 22:34:32,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 22:34:32,338 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:32,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:34:32,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-22 22:34:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-22 22:34:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-22 22:34:32,367 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2023-11-22 22:34:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:32,368 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-22 22:34:32,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-22 22:34:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 22:34:32,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:32,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:32,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 22:34:32,371 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:32,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2065910172, now seen corresponding path program 1 times [2023-11-22 22:34:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:32,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888672679] [2023-11-22 22:34:32,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:32,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:32,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:32,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888672679] [2023-11-22 22:34:32,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888672679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:34:32,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:34:32,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 22:34:32,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714361799] [2023-11-22 22:34:32,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:34:32,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 22:34:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:32,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 22:34:32,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 22:34:32,537 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:32,594 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2023-11-22 22:34:32,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 22:34:32,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-22 22:34:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:32,595 INFO L225 Difference]: With dead ends: 32 [2023-11-22 22:34:32,595 INFO L226 Difference]: Without dead ends: 21 [2023-11-22 22:34:32,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 22:34:32,597 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:32,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 22:34:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-22 22:34:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-11-22 22:34:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-11-22 22:34:32,603 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2023-11-22 22:34:32,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:32,603 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-11-22 22:34:32,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-11-22 22:34:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-22 22:34:32,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:32,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:32,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 22:34:32,604 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:32,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash 785079709, now seen corresponding path program 1 times [2023-11-22 22:34:32,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:32,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459056559] [2023-11-22 22:34:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 22:34:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459056559] [2023-11-22 22:34:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459056559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:34:32,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:34:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 22:34:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315782658] [2023-11-22 22:34:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:34:32,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 22:34:32,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:32,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 22:34:32,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 22:34:32,815 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:32,871 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-22 22:34:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 22:34:32,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-22 22:34:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:32,873 INFO L225 Difference]: With dead ends: 26 [2023-11-22 22:34:32,874 INFO L226 Difference]: Without dead ends: 22 [2023-11-22 22:34:32,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:34:32,876 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:32,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:34:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-22 22:34:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-11-22 22:34:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-11-22 22:34:32,880 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2023-11-22 22:34:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:32,880 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-11-22 22:34:32,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-11-22 22:34:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 22:34:32,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:32,881 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:32,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 22:34:32,881 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:32,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash -485999892, now seen corresponding path program 1 times [2023-11-22 22:34:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:32,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685884232] [2023-11-22 22:34:32,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:32,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685884232] [2023-11-22 22:34:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685884232] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:34:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879027237] [2023-11-22 22:34:32,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:32,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:32,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:34:32,965 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) [2023-11-22 22:34:32,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 22:34:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:33,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 22:34:33,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:34:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:33,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:34:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:33,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879027237] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:34:33,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:34:33,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-22 22:34:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120987370] [2023-11-22 22:34:33,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:34:33,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 22:34:33,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 22:34:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-22 22:34:33,141 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:33,233 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-11-22 22:34:33,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 22:34:33,234 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-22 22:34:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:33,235 INFO L225 Difference]: With dead ends: 42 [2023-11-22 22:34:33,235 INFO L226 Difference]: Without dead ends: 28 [2023-11-22 22:34:33,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-22 22:34:33,241 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:33,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 22:34:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-22 22:34:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2023-11-22 22:34:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-22 22:34:33,253 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2023-11-22 22:34:33,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:33,253 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-22 22:34:33,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-11-22 22:34:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 22:34:33,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:33,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:33,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 22:34:33,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:33,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:33,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash -105964608, now seen corresponding path program 1 times [2023-11-22 22:34:33,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484204044] [2023-11-22 22:34:33,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:33,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:33,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484204044] [2023-11-22 22:34:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484204044] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:34:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611039745] [2023-11-22 22:34:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:33,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:33,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:34:33,988 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) [2023-11-22 22:34:34,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 22:34:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:34,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-22 22:34:34,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:34:34,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 15 treesize of output 1 [2023-11-22 22:34:34,186 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 11 treesize of output 7 [2023-11-22 22:34:34,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-22 22:34:34,263 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 19 treesize of output 11 [2023-11-22 22:34:34,297 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 15 treesize of output 7 [2023-11-22 22:34:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:34,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:34:34,419 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 20 treesize of output 18 [2023-11-22 22:34:34,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 24 [2023-11-22 22:34:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611039745] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:34:34,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:34:34,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 28 [2023-11-22 22:34:34,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366211669] [2023-11-22 22:34:34,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:34:34,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-22 22:34:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-22 22:34:34,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2023-11-22 22:34:34,470 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:34,721 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2023-11-22 22:34:34,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 22:34:34,721 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-22 22:34:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:34,722 INFO L225 Difference]: With dead ends: 49 [2023-11-22 22:34:34,722 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 22:34:34,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=850, Unknown=0, NotChecked=0, Total=1056 [2023-11-22 22:34:34,723 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:34,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 70 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 22:34:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 22:34:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-22 22:34:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-22 22:34:34,726 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2023-11-22 22:34:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:34,727 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-22 22:34:34,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-22 22:34:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 22:34:34,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:34,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:34,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 22:34:34,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:34,939 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:34,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:34,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1605608937, now seen corresponding path program 2 times [2023-11-22 22:34:34,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:34,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872608973] [2023-11-22 22:34:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:34,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:35,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872608973] [2023-11-22 22:34:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872608973] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:34:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64378623] [2023-11-22 22:34:35,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 22:34:35,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:35,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:34:35,044 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) [2023-11-22 22:34:35,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 22:34:35,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 22:34:35,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:34:35,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 22:34:35,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:34:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:35,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:34:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64378623] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:34:35,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:34:35,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-22 22:34:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134900757] [2023-11-22 22:34:35,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:34:35,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 22:34:35,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:35,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 22:34:35,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-22 22:34:35,210 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:35,276 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2023-11-22 22:34:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 22:34:35,276 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-22 22:34:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:35,278 INFO L225 Difference]: With dead ends: 53 [2023-11-22 22:34:35,278 INFO L226 Difference]: Without dead ends: 33 [2023-11-22 22:34:35,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-11-22 22:34:35,279 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:35,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 22 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:34:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-22 22:34:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2023-11-22 22:34:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-22 22:34:35,287 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 25 [2023-11-22 22:34:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:35,287 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-22 22:34:35,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-22 22:34:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 22:34:35,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:35,288 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:35,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 22:34:35,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:35,493 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:35,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:35,493 INFO L85 PathProgramCache]: Analyzing trace with hash 50846651, now seen corresponding path program 3 times [2023-11-22 22:34:35,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:35,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964029210] [2023-11-22 22:34:35,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:36,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964029210] [2023-11-22 22:34:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964029210] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:34:36,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014402297] [2023-11-22 22:34:36,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 22:34:36,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:36,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:34:36,200 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) [2023-11-22 22:34:36,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 22:34:36,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-22 22:34:36,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:34:36,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-22 22:34:36,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:34:36,292 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 [2023-11-22 22:34:36,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 22:34:36,355 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 33 treesize of output 13 [2023-11-22 22:34:36,468 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 11 treesize of output 7 [2023-11-22 22:34:36,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-22 22:34:36,689 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-22 22:34:36,689 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 59 treesize of output 47 [2023-11-22 22:34:36,697 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 59 treesize of output 32 [2023-11-22 22:34:36,886 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 15 treesize of output 7 [2023-11-22 22:34:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:36,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:34:37,510 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 51 treesize of output 47 [2023-11-22 22:34:37,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:34:37,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 282 [2023-11-22 22:34:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:37,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014402297] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:34:37,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:34:37,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 47 [2023-11-22 22:34:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041294264] [2023-11-22 22:34:37,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:34:37,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-22 22:34:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:37,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-22 22:34:37,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1845, Unknown=0, NotChecked=0, Total=2162 [2023-11-22 22:34:37,742 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 47 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 47 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:38,558 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2023-11-22 22:34:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-22 22:34:38,559 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 47 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-22 22:34:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:38,560 INFO L225 Difference]: With dead ends: 51 [2023-11-22 22:34:38,560 INFO L226 Difference]: Without dead ends: 37 [2023-11-22 22:34:38,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=626, Invalid=3156, Unknown=0, NotChecked=0, Total=3782 [2023-11-22 22:34:38,561 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 90 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:38,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 67 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 22:34:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-22 22:34:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2023-11-22 22:34:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-11-22 22:34:38,566 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2023-11-22 22:34:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:38,566 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-11-22 22:34:38,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 47 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-11-22 22:34:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 22:34:38,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:38,567 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:38,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 22:34:38,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:38,779 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:38,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash 245407758, now seen corresponding path program 4 times [2023-11-22 22:34:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682343156] [2023-11-22 22:34:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:38,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:38,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682343156] [2023-11-22 22:34:38,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682343156] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:34:38,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304810718] [2023-11-22 22:34:38,860 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 22:34:38,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:38,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:34:38,862 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) [2023-11-22 22:34:38,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 22:34:38,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 22:34:38,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:34:38,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-22 22:34:38,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:34:38,924 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 23 treesize of output 1 [2023-11-22 22:34:38,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 36 treesize of output 16 [2023-11-22 22:34:38,997 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 0 case distinctions, treesize of input 48 treesize of output 31 [2023-11-22 22:34:39,109 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 11 treesize of output 7 [2023-11-22 22:34:39,191 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 27 treesize of output 19 [2023-11-22 22:34:39,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-11-22 22:34:39,456 INFO L349 Elim1Store]: treesize reduction 26, result has 70.1 percent of original size [2023-11-22 22:34:39,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 96 [2023-11-22 22:34:39,462 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 108 treesize of output 73 [2023-11-22 22:34:39,608 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 15 treesize of output 7 [2023-11-22 22:34:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:39,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:34:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:40,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304810718] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:34:40,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:34:40,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 22] total 50 [2023-11-22 22:34:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490222310] [2023-11-22 22:34:40,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:34:40,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-22 22:34:40,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-22 22:34:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2150, Unknown=0, NotChecked=0, Total=2450 [2023-11-22 22:34:40,315 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 50 states, 50 states have (on average 1.64) internal successors, (82), 50 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:44,541 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2023-11-22 22:34:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-11-22 22:34:44,542 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.64) internal successors, (82), 50 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-22 22:34:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:44,542 INFO L225 Difference]: With dead ends: 114 [2023-11-22 22:34:44,542 INFO L226 Difference]: Without dead ends: 81 [2023-11-22 22:34:44,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5582 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2415, Invalid=15945, Unknown=0, NotChecked=0, Total=18360 [2023-11-22 22:34:44,550 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 192 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:44,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 132 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 22:34:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-22 22:34:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 39. [2023-11-22 22:34:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-22 22:34:44,568 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 31 [2023-11-22 22:34:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:44,568 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-22 22:34:44,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.64) internal successors, (82), 50 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-11-22 22:34:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-22 22:34:44,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:44,569 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:44,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-22 22:34:44,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:44,772 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:44,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1652523061, now seen corresponding path program 5 times [2023-11-22 22:34:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221153719] [2023-11-22 22:34:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:44,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:44,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221153719] [2023-11-22 22:34:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221153719] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:34:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167496864] [2023-11-22 22:34:44,894 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-22 22:34:44,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:44,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:34:44,895 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) [2023-11-22 22:34:44,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 22:34:44,967 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-11-22 22:34:44,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:34:44,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 22:34:44,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:34:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:45,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:34:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:45,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167496864] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:34:45,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:34:45,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-11-22 22:34:45,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156044513] [2023-11-22 22:34:45,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:34:45,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 22:34:45,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:45,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 22:34:45,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-11-22 22:34:45,131 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:45,237 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2023-11-22 22:34:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 22:34:45,238 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-22 22:34:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:45,238 INFO L225 Difference]: With dead ends: 66 [2023-11-22 22:34:45,239 INFO L226 Difference]: Without dead ends: 45 [2023-11-22 22:34:45,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2023-11-22 22:34:45,239 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:45,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 25 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 22:34:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-22 22:34:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-11-22 22:34:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2023-11-22 22:34:45,245 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 37 [2023-11-22 22:34:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:45,246 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2023-11-22 22:34:45,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2023-11-22 22:34:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-22 22:34:45,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:45,247 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:45,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-22 22:34:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:45,458 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:45,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash 435682905, now seen corresponding path program 6 times [2023-11-22 22:34:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067342505] [2023-11-22 22:34:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067342505] [2023-11-22 22:34:46,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067342505] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:34:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880131347] [2023-11-22 22:34:46,563 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-22 22:34:46,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:46,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:34:46,564 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) [2023-11-22 22:34:46,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 22:34:46,679 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-11-22 22:34:46,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:34:46,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-22 22:34:46,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:34:46,721 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 [2023-11-22 22:34:46,760 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 29 treesize of output 13 [2023-11-22 22:34:46,814 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 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-22 22:34:46,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2023-11-22 22:34:47,033 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 11 treesize of output 7 [2023-11-22 22:34:47,100 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 27 treesize of output 19 [2023-11-22 22:34:47,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-11-22 22:34:47,334 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 53 treesize of output 41 [2023-11-22 22:34:47,583 INFO L349 Elim1Store]: treesize reduction 72, result has 44.2 percent of original size [2023-11-22 22:34:47,584 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 99 treesize of output 96 [2023-11-22 22:34:47,590 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 85 treesize of output 54 [2023-11-22 22:34:47,766 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 15 treesize of output 7 [2023-11-22 22:34:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:47,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:34:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:48,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880131347] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:34:48,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:34:48,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 72 [2023-11-22 22:34:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205864265] [2023-11-22 22:34:48,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:34:48,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-22 22:34:48,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:48,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-22 22:34:48,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=4547, Unknown=0, NotChecked=0, Total=5112 [2023-11-22 22:34:48,761 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 72 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:56,667 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2023-11-22 22:34:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-11-22 22:34:56,668 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-11-22 22:34:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:56,669 INFO L225 Difference]: With dead ends: 187 [2023-11-22 22:34:56,669 INFO L226 Difference]: Without dead ends: 146 [2023-11-22 22:34:56,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9351 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=4176, Invalid=25580, Unknown=0, NotChecked=0, Total=29756 [2023-11-22 22:34:56,674 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 599 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:56,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 156 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 22:34:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-22 22:34:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 86. [2023-11-22 22:34:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2) internal successors, (102), 85 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2023-11-22 22:34:56,692 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 40 [2023-11-22 22:34:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:56,692 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2023-11-22 22:34:56,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2023-11-22 22:34:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-22 22:34:56,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:56,693 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:56,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-22 22:34:56,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:56,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:56,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash 838945835, now seen corresponding path program 7 times [2023-11-22 22:34:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:56,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476941915] [2023-11-22 22:34:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:56,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 54 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:57,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:57,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476941915] [2023-11-22 22:34:57,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476941915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:34:57,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459833514] [2023-11-22 22:34:57,055 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-22 22:34:57,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:57,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:34:57,056 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) [2023-11-22 22:34:57,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-22 22:34:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:57,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 22:34:57,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:34:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:57,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:34:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:57,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459833514] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:34:57,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:34:57,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2023-11-22 22:34:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818924947] [2023-11-22 22:34:57,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:34:57,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-22 22:34:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-22 22:34:57,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2023-11-22 22:34:57,386 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:57,630 INFO L93 Difference]: Finished difference Result 236 states and 267 transitions. [2023-11-22 22:34:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-22 22:34:57,630 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-11-22 22:34:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:57,631 INFO L225 Difference]: With dead ends: 236 [2023-11-22 22:34:57,631 INFO L226 Difference]: Without dead ends: 146 [2023-11-22 22:34:57,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 76 SyntacticMatches, 13 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2023-11-22 22:34:57,632 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 82 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:57,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 50 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 22:34:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-22 22:34:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2023-11-22 22:34:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.2327586206896552) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2023-11-22 22:34:57,658 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 49 [2023-11-22 22:34:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:57,659 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2023-11-22 22:34:57,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2023-11-22 22:34:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-22 22:34:57,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:57,660 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:57,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-22 22:34:57,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-22 22:34:57,870 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:57,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:57,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1426625582, now seen corresponding path program 8 times [2023-11-22 22:34:57,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:57,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510136076] [2023-11-22 22:34:57,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:57,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:34:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 35 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:34:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510136076] [2023-11-22 22:34:58,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510136076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:34:58,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872894906] [2023-11-22 22:34:58,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 22:34:58,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:58,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:34:58,059 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) [2023-11-22 22:34:58,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-22 22:34:58,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 22:34:58,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:34:58,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 22:34:58,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:34:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 51 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:58,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:34:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 51 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:34:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872894906] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:34:58,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 22:34:58,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2023-11-22 22:34:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563180135] [2023-11-22 22:34:58,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 22:34:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-22 22:34:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:34:58,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-22 22:34:58,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2023-11-22 22:34:58,423 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:34:58,724 INFO L93 Difference]: Finished difference Result 142 states and 168 transitions. [2023-11-22 22:34:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-22 22:34:58,725 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-11-22 22:34:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:34:58,726 INFO L225 Difference]: With dead ends: 142 [2023-11-22 22:34:58,726 INFO L226 Difference]: Without dead ends: 118 [2023-11-22 22:34:58,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 75 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2023-11-22 22:34:58,727 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 22:34:58,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 32 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 22:34:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-22 22:34:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 54. [2023-11-22 22:34:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-22 22:34:58,743 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 49 [2023-11-22 22:34:58,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:34:58,744 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-22 22:34:58,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:34:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-22 22:34:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 22:34:58,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:34:58,747 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:34:58,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-22 22:34:58,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:34:58,956 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:34:58,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:34:58,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1908808329, now seen corresponding path program 9 times [2023-11-22 22:34:58,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:34:58,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860720415] [2023-11-22 22:34:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:34:58,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:34:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:35:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:35:01,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860720415] [2023-11-22 22:35:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860720415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 22:35:01,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550129041] [2023-11-22 22:35:01,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 22:35:01,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 22:35:01,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:35:01,114 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) [2023-11-22 22:35:01,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-22 22:35:01,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-22 22:35:01,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:35:01,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-22 22:35:01,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:35:01,294 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 [2023-11-22 22:35:01,348 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 23 treesize of output 11 [2023-11-22 22:35:01,414 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 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-22 22:35:01,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-22 22:35:01,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-11-22 22:35:01,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2023-11-22 22:35:01,965 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 11 treesize of output 7 [2023-11-22 22:35:02,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-22 22:35:02,239 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 21 [2023-11-22 22:35:02,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-11-22 22:35:02,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-11-22 22:35:02,699 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 51 treesize of output 39 [2023-11-22 22:35:02,917 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 54 treesize of output 42 [2023-11-22 22:35:02,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:02,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 32 [2023-11-22 22:35:03,039 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 15 treesize of output 7 [2023-11-22 22:35:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:03,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:35:05,319 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 225 treesize of output 217 [2023-11-22 22:35:17,938 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-22 22:35:17,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-22 22:35:18,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-22 22:35:18,145 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 446787 column 7: push canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 446787 column 7: push canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 55 more [2023-11-22 22:35:18,149 INFO L158 Benchmark]: Toolchain (without parser) took 46583.36ms. Allocated memory was 155.2MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 85.1MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-22 22:35:18,149 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory was 74.1MB in the beginning and 73.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 22:35:18,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.24ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 74.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 22:35:18,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 155.2MB. Free memory was 73.9MB in the beginning and 72.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 22:35:18,150 INFO L158 Benchmark]: Boogie Preprocessor took 53.35ms. Allocated memory is still 155.2MB. Free memory was 72.2MB in the beginning and 70.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 22:35:18,150 INFO L158 Benchmark]: RCFGBuilder took 259.74ms. Allocated memory is still 155.2MB. Free memory was 70.4MB in the beginning and 121.5MB in the end (delta: -51.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2023-11-22 22:35:18,150 INFO L158 Benchmark]: TraceAbstraction took 46068.38ms. Allocated memory was 155.2MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 120.8MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-22 22:35:18,151 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.15ms. Allocated memory is still 113.2MB. Free memory was 74.1MB in the beginning and 73.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.24ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 74.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 155.2MB. Free memory was 73.9MB in the beginning and 72.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.35ms. Allocated memory is still 155.2MB. Free memory was 72.2MB in the beginning and 70.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 259.74ms. Allocated memory is still 155.2MB. Free memory was 70.4MB in the beginning and 121.5MB in the end (delta: -51.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 46068.38ms. Allocated memory was 155.2MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 120.8MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 446787 column 7: push canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 446787 column 7: push canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-22 22:35:18,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 1 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 ../../../trunk/examples/svcomp/array-fpi/brs2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc354f47e1cc26b26f82415b2113a1e937a24cebf9ecb225fe7f6242be1c8136 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 22:35:20,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 22:35:20,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 22:35:20,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 22:35:20,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 22:35:20,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 22:35:20,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 22:35:20,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 22:35:20,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 22:35:20,206 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 22:35:20,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 22:35:20,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 22:35:20,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 22:35:20,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 22:35:20,208 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 22:35:20,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 22:35:20,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 22:35:20,209 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 22:35:20,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 22:35:20,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 22:35:20,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 22:35:20,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 22:35:20,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 22:35:20,211 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 22:35:20,211 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 22:35:20,211 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 22:35:20,211 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 22:35:20,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 22:35:20,212 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 22:35:20,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 22:35:20,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 22:35:20,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 22:35:20,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 22:35:20,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:35:20,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 22:35:20,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 22:35:20,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 22:35:20,214 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 22:35:20,215 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 22:35:20,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 22:35:20,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 22:35:20,215 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 22:35:20,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 22:35:20,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 22:35:20,216 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 22:35:20,216 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 -> fc354f47e1cc26b26f82415b2113a1e937a24cebf9ecb225fe7f6242be1c8136 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 22:35:20,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 22:35:20,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 22:35:20,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 22:35:20,505 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 22:35:20,506 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 22:35:20,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs2.c [2023-11-22 22:35:21,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 22:35:21,726 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 22:35:21,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2.c [2023-11-22 22:35:21,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/447942ef3/7c193fa9fdbe4525bcb2a4501e7eb9b1/FLAGb45f08a89 [2023-11-22 22:35:21,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/447942ef3/7c193fa9fdbe4525bcb2a4501e7eb9b1 [2023-11-22 22:35:21,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 22:35:21,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 22:35:21,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 22:35:21,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 22:35:21,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 22:35:21,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:21,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b3b6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21, skipping insertion in model container [2023-11-22 22:35:21,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:21,774 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 22:35:21,899 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2.c[587,600] [2023-11-22 22:35:21,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:35:21,928 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 22:35:21,941 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2.c[587,600] [2023-11-22 22:35:21,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:35:21,972 INFO L206 MainTranslator]: Completed translation [2023-11-22 22:35:21,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21 WrapperNode [2023-11-22 22:35:21,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 22:35:21,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 22:35:21,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 22:35:21,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 22:35:21,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:21,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,012 INFO L138 Inliner]: procedures = 21, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2023-11-22 22:35:22,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 22:35:22,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 22:35:22,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 22:35:22,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 22:35:22,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,028 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,042 INFO L189 HeapSplitter]: Split 16 memory accesses to 4 slices as follows [2, 7, 4, 3] [2023-11-22 22:35:22,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 22:35:22,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 22:35:22,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 22:35:22,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 22:35:22,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (1/1) ... [2023-11-22 22:35:22,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:35:22,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:35:22,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 22:35:22,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 22:35:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 22:35:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 22:35:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-22 22:35:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-22 22:35:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-22 22:35:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 22:35:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-11-22 22:35:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-11-22 22:35:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-11-22 22:35:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-11-22 22:35:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 22:35:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-22 22:35:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-22 22:35:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-22 22:35:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-22 22:35:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 22:35:22,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 22:35:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-11-22 22:35:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-11-22 22:35:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-11-22 22:35:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-11-22 22:35:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 22:35:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-22 22:35:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-22 22:35:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-22 22:35:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-22 22:35:22,240 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 22:35:22,241 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 22:35:22,427 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 22:35:22,450 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 22:35:22,453 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 22:35:22,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:35:22 BoogieIcfgContainer [2023-11-22 22:35:22,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 22:35:22,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 22:35:22,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 22:35:22,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 22:35:22,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:35:21" (1/3) ... [2023-11-22 22:35:22,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297c4709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:35:22, skipping insertion in model container [2023-11-22 22:35:22,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:35:21" (2/3) ... [2023-11-22 22:35:22,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297c4709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:35:22, skipping insertion in model container [2023-11-22 22:35:22,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:35:22" (3/3) ... [2023-11-22 22:35:22,461 INFO L112 eAbstractionObserver]: Analyzing ICFG brs2.c [2023-11-22 22:35:22,474 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 22:35:22,474 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 22:35:22,511 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 22:35:22,516 INFO L357 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, mHoare=true, 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;@30154e04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 22:35:22,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 22:35:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 22:35:22,524 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:35:22,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:35:22,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:35:22,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:35:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1256235845, now seen corresponding path program 1 times [2023-11-22 22:35:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:35:22,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329944038] [2023-11-22 22:35:22,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:35:22,540 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 [2023-11-22 22:35:22,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:35:22,542 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) [2023-11-22 22:35:22,563 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 [2023-11-22 22:35:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:35:22,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 22:35:22,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:35:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:22,656 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 22:35:22,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:35:22,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329944038] [2023-11-22 22:35:22,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329944038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:35:22,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:35:22,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 22:35:22,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604431501] [2023-11-22 22:35:22,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:35:22,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 22:35:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:35:22,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 22:35:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 22:35:22,688 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:35:22,701 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2023-11-22 22:35:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 22:35:22,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-22 22:35:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:35:22,713 INFO L225 Difference]: With dead ends: 33 [2023-11-22 22:35:22,713 INFO L226 Difference]: Without dead ends: 15 [2023-11-22 22:35:22,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 22:35:22,718 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:35:22,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:35:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-22 22:35:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-22 22:35:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-22 22:35:22,741 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2023-11-22 22:35:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:35:22,741 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-22 22:35:22,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-22 22:35:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 22:35:22,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:35:22,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:35:22,746 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 [2023-11-22 22:35:22,944 WARN L477 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 [2023-11-22 22:35:22,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:35:22,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:35:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2065910172, now seen corresponding path program 1 times [2023-11-22 22:35:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:35:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129191105] [2023-11-22 22:35:22,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:35:22,948 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 [2023-11-22 22:35:22,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:35:22,949 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) [2023-11-22 22:35:23,008 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 [2023-11-22 22:35:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:35:23,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 22:35:23,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:35:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:23,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 22:35:23,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:35:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129191105] [2023-11-22 22:35:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129191105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:35:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:35:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 22:35:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504252408] [2023-11-22 22:35:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:35:23,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 22:35:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:35:23,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 22:35:23,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 22:35:23,151 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:35:23,210 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2023-11-22 22:35:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 22:35:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-22 22:35:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:35:23,212 INFO L225 Difference]: With dead ends: 32 [2023-11-22 22:35:23,212 INFO L226 Difference]: Without dead ends: 21 [2023-11-22 22:35:23,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:35:23,213 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:35:23,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 13 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:35:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-22 22:35:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-11-22 22:35:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-11-22 22:35:23,217 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2023-11-22 22:35:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:35:23,217 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-11-22 22:35:23,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-11-22 22:35:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-22 22:35:23,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:35:23,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:35:23,228 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 (3)] Forceful destruction successful, exit code 0 [2023-11-22 22:35:23,420 WARN L477 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 [2023-11-22 22:35:23,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:35:23,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:35:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash 785079709, now seen corresponding path program 1 times [2023-11-22 22:35:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:35:23,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416651572] [2023-11-22 22:35:23,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:35:23,421 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 [2023-11-22 22:35:23,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:35:23,422 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) [2023-11-22 22:35:23,426 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 [2023-11-22 22:35:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:35:23,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 22:35:23,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:35:23,528 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:35:23,535 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 18 treesize of output 19 [2023-11-22 22:35:23,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:23,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 35 [2023-11-22 22:35:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 22:35:23,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 22:35:23,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:35:23,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416651572] [2023-11-22 22:35:23,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416651572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:35:23,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:35:23,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:35:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162591914] [2023-11-22 22:35:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:35:23,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:35:23,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:35:23,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:35:23,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:35:23,650 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:35:23,725 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-22 22:35:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 22:35:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-22 22:35:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:35:23,727 INFO L225 Difference]: With dead ends: 26 [2023-11-22 22:35:23,727 INFO L226 Difference]: Without dead ends: 22 [2023-11-22 22:35:23,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-22 22:35:23,729 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:35:23,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:35:23,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-22 22:35:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-11-22 22:35:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-11-22 22:35:23,735 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2023-11-22 22:35:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:35:23,736 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-11-22 22:35:23,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-11-22 22:35:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 22:35:23,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:35:23,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:35:23,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 22:35:23,938 WARN L477 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 [2023-11-22 22:35:23,939 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:35:23,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:35:23,939 INFO L85 PathProgramCache]: Analyzing trace with hash -485999892, now seen corresponding path program 1 times [2023-11-22 22:35:23,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:35:23,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809787299] [2023-11-22 22:35:23,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:35:23,940 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 [2023-11-22 22:35:23,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:35:23,942 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) [2023-11-22 22:35:23,943 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 [2023-11-22 22:35:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:35:23,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 22:35:23,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:35:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:24,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:35:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:24,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:35:24,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809787299] [2023-11-22 22:35:24,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809787299] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:35:24,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 22:35:24,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-11-22 22:35:24,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350799280] [2023-11-22 22:35:24,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 22:35:24,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 22:35:24,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:35:24,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 22:35:24,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-11-22 22:35:24,195 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:35:24,351 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-11-22 22:35:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 22:35:24,352 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-22 22:35:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:35:24,352 INFO L225 Difference]: With dead ends: 47 [2023-11-22 22:35:24,352 INFO L226 Difference]: Without dead ends: 27 [2023-11-22 22:35:24,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-11-22 22:35:24,353 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:35:24,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 17 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 22:35:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-22 22:35:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-11-22 22:35:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-22 22:35:24,358 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2023-11-22 22:35:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:35:24,358 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-22 22:35:24,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-22 22:35:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 22:35:24,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:35:24,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:35:24,368 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 [2023-11-22 22:35:24,559 WARN L477 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 [2023-11-22 22:35:24,559 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:35:24,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:35:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash -105964608, now seen corresponding path program 1 times [2023-11-22 22:35:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:35:24,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370650737] [2023-11-22 22:35:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:35:24,560 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 [2023-11-22 22:35:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:35:24,561 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) [2023-11-22 22:35:24,562 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 [2023-11-22 22:35:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:35:24,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-22 22:35:24,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:35:24,674 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 13 treesize of output 9 [2023-11-22 22:35:24,734 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:35:24,735 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 18 treesize of output 19 [2023-11-22 22:35:24,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:24,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 37 [2023-11-22 22:35:24,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:24,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 49 [2023-11-22 22:35:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:24,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:35:25,162 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 50 treesize of output 46 [2023-11-22 22:35:25,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 62 [2023-11-22 22:35:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:25,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:35:25,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370650737] [2023-11-22 22:35:25,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370650737] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:35:25,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 22:35:25,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-11-22 22:35:25,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153940999] [2023-11-22 22:35:25,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 22:35:25,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-22 22:35:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:35:25,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-22 22:35:25,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-11-22 22:35:25,548 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:27,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 22:35:29,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 22:35:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:35:30,000 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-11-22 22:35:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 22:35:30,000 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-22 22:35:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:35:30,001 INFO L225 Difference]: With dead ends: 33 [2023-11-22 22:35:30,001 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 22:35:30,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2023-11-22 22:35:30,002 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:35:30,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 31 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2023-11-22 22:35:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 22:35:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-22 22:35:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-22 22:35:30,005 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2023-11-22 22:35:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:35:30,006 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-22 22:35:30,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-22 22:35:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 22:35:30,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:35:30,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:35:30,012 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 [2023-11-22 22:35:30,209 WARN L477 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 [2023-11-22 22:35:30,209 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:35:30,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:35:30,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1605608937, now seen corresponding path program 2 times [2023-11-22 22:35:30,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:35:30,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710194782] [2023-11-22 22:35:30,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 22:35:30,210 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 [2023-11-22 22:35:30,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:35:30,211 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) [2023-11-22 22:35:30,217 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 [2023-11-22 22:35:30,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 22:35:30,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:35:30,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 22:35:30,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:35:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:30,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:35:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:30,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:35:30,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710194782] [2023-11-22 22:35:30,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710194782] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:35:30,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 22:35:30,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-22 22:35:30,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744662823] [2023-11-22 22:35:30,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 22:35:30,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 22:35:30,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:35:30,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 22:35:30,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-11-22 22:35:30,668 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:35:31,292 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2023-11-22 22:35:31,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-22 22:35:31,298 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-22 22:35:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:35:31,298 INFO L225 Difference]: With dead ends: 79 [2023-11-22 22:35:31,298 INFO L226 Difference]: Without dead ends: 53 [2023-11-22 22:35:31,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=981, Unknown=0, NotChecked=0, Total=1260 [2023-11-22 22:35:31,299 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 96 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:35:31,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 35 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 22:35:31,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-22 22:35:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2023-11-22 22:35:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-11-22 22:35:31,304 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 25 [2023-11-22 22:35:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:35:31,305 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-11-22 22:35:31,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-11-22 22:35:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 22:35:31,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:35:31,306 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:35:31,316 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 [2023-11-22 22:35:31,512 WARN L477 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 [2023-11-22 22:35:31,512 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:35:31,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:35:31,513 INFO L85 PathProgramCache]: Analyzing trace with hash 50846651, now seen corresponding path program 3 times [2023-11-22 22:35:31,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:35:31,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206117187] [2023-11-22 22:35:31,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 22:35:31,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 22:35:31,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:35:31,514 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) [2023-11-22 22:35:31,517 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 [2023-11-22 22:35:31,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-22 22:35:31,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:35:31,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-22 22:35:31,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:35:31,675 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 13 treesize of output 9 [2023-11-22 22:35:31,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-22 22:35:31,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:35:31,821 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 18 treesize of output 19 [2023-11-22 22:35:31,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:31,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 37 [2023-11-22 22:35:32,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:32,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 37 [2023-11-22 22:35:32,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:32,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 49 [2023-11-22 22:35:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:32,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:35:32,952 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 178 treesize of output 166 [2023-11-22 22:35:32,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:32,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2290 treesize of output 2098 [2023-11-22 22:35:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:34,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:35:34,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206117187] [2023-11-22 22:35:34,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206117187] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:35:34,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 22:35:34,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2023-11-22 22:35:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535934897] [2023-11-22 22:35:34,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 22:35:34,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-22 22:35:34,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:35:34,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-22 22:35:34,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2023-11-22 22:35:34,858 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:35:41,526 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2023-11-22 22:35:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-22 22:35:41,528 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-22 22:35:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:35:41,530 INFO L225 Difference]: With dead ends: 76 [2023-11-22 22:35:41,530 INFO L226 Difference]: Without dead ends: 72 [2023-11-22 22:35:41,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2023-11-22 22:35:41,531 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 102 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:35:41,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 39 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-22 22:35:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-22 22:35:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 33. [2023-11-22 22:35:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-11-22 22:35:41,536 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2023-11-22 22:35:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:35:41,537 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-11-22 22:35:41,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-11-22 22:35:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 22:35:41,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:35:41,537 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:35:41,542 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 (8)] Forceful destruction successful, exit code 0 [2023-11-22 22:35:41,740 WARN L477 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 [2023-11-22 22:35:41,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:35:41,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:35:41,741 INFO L85 PathProgramCache]: Analyzing trace with hash 245407758, now seen corresponding path program 4 times [2023-11-22 22:35:41,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:35:41,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658160061] [2023-11-22 22:35:41,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 22:35:41,741 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 [2023-11-22 22:35:41,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:35:41,742 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) [2023-11-22 22:35:41,743 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 [2023-11-22 22:35:41,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 22:35:41,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:35:41,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 22:35:41,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:35:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:42,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:35:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:42,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:35:42,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658160061] [2023-11-22 22:35:42,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658160061] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:35:42,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 22:35:42,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2023-11-22 22:35:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734068930] [2023-11-22 22:35:42,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 22:35:42,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-22 22:35:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:35:42,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-22 22:35:42,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2023-11-22 22:35:42,505 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:35:42,929 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2023-11-22 22:35:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-22 22:35:42,930 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-22 22:35:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:35:42,930 INFO L225 Difference]: With dead ends: 71 [2023-11-22 22:35:42,931 INFO L226 Difference]: Without dead ends: 39 [2023-11-22 22:35:42,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2023-11-22 22:35:42,931 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 22:35:42,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 18 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 22:35:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-22 22:35:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-11-22 22:35:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2023-11-22 22:35:42,936 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 31 [2023-11-22 22:35:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:35:42,936 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-11-22 22:35:42,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:35:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2023-11-22 22:35:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 22:35:42,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:35:42,937 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:35:42,942 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 [2023-11-22 22:35:43,137 WARN L477 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 [2023-11-22 22:35:43,138 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:35:43,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:35:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1051108066, now seen corresponding path program 5 times [2023-11-22 22:35:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:35:43,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147183234] [2023-11-22 22:35:43,139 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-22 22:35:43,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 22:35:43,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:35:43,139 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) [2023-11-22 22:35:43,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-22 22:35:43,237 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-22 22:35:43,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 22:35:43,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-22 22:35:43,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:35:43,347 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 11 treesize of output 7 [2023-11-22 22:35:43,396 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 19 treesize of output 18 [2023-11-22 22:35:43,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:43,488 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 26 treesize of output 28 [2023-11-22 22:35:43,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 22:35:43,680 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 18 treesize of output 19 [2023-11-22 22:35:43,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:43,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 37 [2023-11-22 22:35:44,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:44,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 37 [2023-11-22 22:35:44,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:44,266 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 81 treesize of output 51 [2023-11-22 22:35:44,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:44,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 77 [2023-11-22 22:35:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:35:44,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:35:48,542 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 514 treesize of output 486 [2023-11-22 22:35:48,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 22:35:48,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 528626 treesize of output 499954 [2023-11-22 22:36:05,386 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse146 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse11 ((_ sign_extend 32) (_ bv0 32))) (.cse14 (concat ((_ extract 63 32) (_ bv0 64)) ((_ extract 31 0) (_ bv0 64))))) (let ((.cse8 (let ((.cse151 (bvadd .cse11 .cse14))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151)))) (.cse24 ((_ sign_extend 32) (_ bv2 32))) (.cse3 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32)))) (.cse15 (= (_ bv0 32) .cse146))) (or (bvslt (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse16 (= (bvadd (_ bv8 32) .cse146) (_ bv0 32))) (.cse5 (let ((.cse147 (bvadd .cse11 (let ((.cse148 (bvadd .cse14 .cse24))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148)))))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147)))) (.cse108 (= (_ bv8 32) .cse146))) (and (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse9 ((_ sign_extend 32) v_arrayElimCell_33))) (let ((.cse2 (let ((.cse12 (bvadd (let ((.cse13 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))) .cse9))) (concat ((_ extract 63 32) .cse12) ((_ extract 31 0) .cse12))))) (or (forall ((v_arrayElimCell_31 (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) v_arrayElimCell_31))) (or (bvsle (let ((.cse0 (bvadd .cse1 .cse2))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) .cse3) (bvsle (let ((.cse4 (bvadd .cse1 .cse5))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4))) .cse3) (bvsle (let ((.cse6 (bvadd .cse1 (let ((.cse7 (bvadd .cse8 .cse9))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7)))))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6))) .cse3)))) (bvsle (let ((.cse10 (bvadd .cse11 .cse2))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))) .cse3))))) (not .cse15) (or .cse16 (and (forall ((v_arrayElimCell_31 (_ BitVec 32))) (let ((.cse18 ((_ sign_extend 32) v_arrayElimCell_31))) (or (bvsle (let ((.cse17 (bvadd .cse18 .cse5))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))) .cse3) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse23 (let ((.cse27 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27))))) (let ((.cse20 (let ((.cse26 (bvadd .cse23 ((_ sign_extend 32) v_arrayElimCell_33)))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))))) (or (bvsle (let ((.cse19 (bvadd .cse18 .cse20))) (concat ((_ extract 63 32) .cse19) ((_ extract 31 0) .cse19))) .cse3) (bvsle (let ((.cse21 (bvadd (let ((.cse22 (bvadd .cse11 .cse23))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))) .cse24))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21))) .cse3) (bvsle (let ((.cse25 (bvadd .cse11 .cse20))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))) .cse3)))))))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse32 (let ((.cse35 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))))) (let ((.cse29 (let ((.cse34 (bvadd .cse32 ((_ sign_extend 32) v_arrayElimCell_33)))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34))))) (or (bvsle (let ((.cse28 (bvadd ((_ sign_extend 32) v_arrayElimCell_31) .cse29))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28))) .cse3) (bvsle (let ((.cse30 (bvadd (let ((.cse31 (bvadd .cse11 .cse32))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31))) .cse24))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30))) .cse3) (bvsle (let ((.cse33 (bvadd .cse11 .cse29))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33))) .cse3))))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse37 (let ((.cse39 (bvadd (let ((.cse40 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40))) ((_ sign_extend 32) v_arrayElimCell_33)))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39))))) (or (bvsle (let ((.cse36 (bvadd ((_ sign_extend 32) v_arrayElimCell_31) .cse37))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse3) (bvsle (let ((.cse38 (bvadd .cse11 .cse37))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))) .cse3)))) (forall ((v_arrayElimCell_31 (_ BitVec 32))) (let ((.cse42 ((_ sign_extend 32) v_arrayElimCell_31))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse43 (let ((.cse45 (bvadd (let ((.cse46 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46))) ((_ sign_extend 32) v_arrayElimCell_33)))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))))) (or (bvsle (let ((.cse41 (bvadd .cse42 .cse43))) (concat ((_ extract 63 32) .cse41) ((_ extract 31 0) .cse41))) .cse3) (bvsle (let ((.cse44 (bvadd .cse11 .cse43))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44))) .cse3)))) (bvsle (let ((.cse47 (bvadd .cse42 .cse5))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))) .cse3)))))) (or (not .cse16) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (bvsle (let ((.cse48 (bvadd ((_ sign_extend 32) v_arrayElimCell_31) (let ((.cse49 (bvadd .cse8 ((_ sign_extend 32) v_arrayElimCell_33)))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49)))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) .cse3))) (or (and (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse51 ((_ sign_extend 32) v_arrayElimCell_31)) (.cse54 ((_ sign_extend 32) v_arrayElimCell_33))) (or (bvsle (let ((.cse50 (bvadd .cse51 (let ((.cse52 (bvadd (let ((.cse53 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse54))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52)))))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))) .cse3) (bvsle (let ((.cse55 (bvadd .cse51 (let ((.cse56 (bvadd .cse8 .cse54))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56)))))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse3)))) (or .cse16 (and (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse59 (let ((.cse62 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))))) (or (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (bvsle (let ((.cse57 (bvadd ((_ sign_extend 32) v_arrayElimCell_31) (let ((.cse58 (bvadd .cse59 ((_ sign_extend 32) v_arrayElimCell_33)))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58)))))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57))) .cse3)) (bvsle (let ((.cse60 (bvadd (let ((.cse61 (bvadd .cse11 .cse59))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) .cse24))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse3)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse64 ((_ sign_extend 32) v_arrayElimCell_31))) (or (bvsle (let ((.cse63 (bvadd .cse64 (let ((.cse65 (bvadd (let ((.cse66 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66))) ((_ sign_extend 32) v_arrayElimCell_33)))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65)))))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))) .cse3) (bvsle (let ((.cse67 (bvadd .cse64 .cse5))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67))) .cse3)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (bvsle (let ((.cse68 (bvadd ((_ sign_extend 32) v_arrayElimCell_31) (let ((.cse69 (bvadd (let ((.cse70 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) ((_ sign_extend 32) v_arrayElimCell_33)))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69)))))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68))) .cse3)) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse73 (let ((.cse78 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))))) (or (bvsle (let ((.cse71 (bvadd (let ((.cse72 (bvadd .cse11 .cse73))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))) .cse24))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71))) .cse3) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse75 ((_ sign_extend 32) v_arrayElimCell_31))) (or (bvsle (let ((.cse74 (bvadd .cse75 (let ((.cse76 (bvadd .cse73 ((_ sign_extend 32) v_arrayElimCell_33)))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76)))))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse3) (bvsle (let ((.cse77 (bvadd .cse75 .cse5))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))) .cse3))))))))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse82 (let ((.cse88 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))))) (or (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse80 ((_ sign_extend 32) v_arrayElimCell_31)) (.cse83 ((_ sign_extend 32) v_arrayElimCell_33))) (or (bvsle (let ((.cse79 (bvadd .cse80 (let ((.cse81 (bvadd .cse82 .cse83))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81)))))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))) .cse3) (bvsle (let ((.cse84 (bvadd .cse80 (let ((.cse85 (bvadd .cse8 .cse83))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85)))))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84))) .cse3)))) (bvsle (let ((.cse86 (bvadd (let ((.cse87 (bvadd .cse11 .cse82))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87))) .cse24))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse3)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse90 ((_ sign_extend 32) v_arrayElimCell_31)) (.cse93 ((_ sign_extend 32) v_arrayElimCell_33))) (or (bvsle (let ((.cse89 (bvadd .cse90 (let ((.cse91 (bvadd (let ((.cse92 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92))) .cse93))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91)))))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89))) .cse3) (bvsle (let ((.cse94 (bvadd .cse90 .cse5))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse3) (bvsle (let ((.cse95 (bvadd .cse90 (let ((.cse96 (bvadd .cse8 .cse93))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96)))))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95))) .cse3)))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse99 (let ((.cse107 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))))) (or (bvsle (let ((.cse97 (bvadd (let ((.cse98 (bvadd .cse11 .cse99))) (concat ((_ extract 63 32) .cse98) ((_ extract 31 0) .cse98))) .cse24))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse3) (forall ((v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse101 ((_ sign_extend 32) v_arrayElimCell_31)) (.cse103 ((_ sign_extend 32) v_arrayElimCell_33))) (or (bvsle (let ((.cse100 (bvadd .cse101 (let ((.cse102 (bvadd .cse99 .cse103))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102)))))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100))) .cse3) (bvsle (let ((.cse104 (bvadd .cse101 .cse5))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse3) (bvsle (let ((.cse105 (bvadd .cse101 (let ((.cse106 (bvadd .cse8 .cse103))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106)))))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))) .cse3)))))))) .cse108) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse118 (let ((.cse121 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121))))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse115 ((_ sign_extend 32) v_arrayElimCell_33))) (let ((.cse111 (let ((.cse117 (bvadd .cse118 .cse115))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117))))) (or (forall ((v_arrayElimCell_31 (_ BitVec 32))) (let ((.cse110 ((_ sign_extend 32) v_arrayElimCell_31))) (or (bvsle (let ((.cse109 (bvadd .cse110 .cse111))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse3) (bvsle (let ((.cse112 (bvadd .cse110 .cse5))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112))) .cse3) (bvsle (let ((.cse113 (bvadd .cse110 (let ((.cse114 (bvadd .cse8 .cse115))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114)))))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113))) .cse3)))) (bvsle (let ((.cse116 (bvadd .cse11 .cse111))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))) .cse3))))) (bvsle (let ((.cse119 (bvadd (let ((.cse120 (bvadd .cse11 .cse118))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120))) .cse24))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))) .cse3)))) (or (not .cse108) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (bvsle (let ((.cse122 (bvadd .cse11 (let ((.cse123 (bvadd (let ((.cse124 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))) ((_ sign_extend 32) v_arrayElimCell_33)))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123)))))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) .cse3))) (forall ((v_arrayElimCell_32 (_ BitVec 32))) (let ((.cse133 (let ((.cse136 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse130 ((_ sign_extend 32) v_arrayElimCell_33))) (let ((.cse127 (let ((.cse132 (bvadd .cse133 .cse130))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))))) (or (forall ((v_arrayElimCell_31 (_ BitVec 32))) (let ((.cse126 ((_ sign_extend 32) v_arrayElimCell_31))) (or (bvsle (let ((.cse125 (bvadd .cse126 .cse127))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))) .cse3) (bvsle (let ((.cse128 (bvadd .cse126 (let ((.cse129 (bvadd .cse8 .cse130))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129)))))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128))) .cse3)))) (bvsle (let ((.cse131 (bvadd .cse11 .cse127))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131))) .cse3))))) (bvsle (let ((.cse134 (bvadd (let ((.cse135 (bvadd .cse11 .cse133))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))) .cse24))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134))) .cse3)))) (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse142 ((_ sign_extend 32) v_arrayElimCell_33))) (let ((.cse139 (let ((.cse144 (bvadd (let ((.cse145 (bvadd ((_ sign_extend 32) v_arrayElimCell_32) .cse14))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse142))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))))) (or (forall ((v_arrayElimCell_31 (_ BitVec 32))) (let ((.cse138 ((_ sign_extend 32) v_arrayElimCell_31))) (or (bvsle (let ((.cse137 (bvadd .cse138 .cse139))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) .cse3) (bvsle (let ((.cse140 (bvadd .cse138 (let ((.cse141 (bvadd .cse8 .cse142))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141)))))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140))) .cse3)))) (bvsle (let ((.cse143 (bvadd .cse11 .cse139))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))) .cse3))))))) (not (= (bvsrem (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv2 32)) (_ bv0 32))) (and (bvsle (let ((.cse149 (bvadd .cse11 (let ((.cse150 (bvadd .cse8 .cse24))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150)))))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149))) .cse3) .cse15) (not (bvslt (_ bv1 32) c_~N~0))))) is different from false [2023-11-22 22:36:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-11-22 22:36:07,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:36:07,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147183234] [2023-11-22 22:36:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147183234] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 22:36:07,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 22:36:07,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2023-11-22 22:36:07,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378807591] [2023-11-22 22:36:07,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 22:36:07,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-22 22:36:07,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:36:07,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-22 22:36:07,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1303, Unknown=3, NotChecked=76, Total=1640 [2023-11-22 22:36:07,126 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 41 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 22:36:40,672 WARN L293 SmtUtils]: Spent 15.08s on a formula simplification. DAG size of input: 280 DAG size of output: 271 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 22:37:18,180 WARN L293 SmtUtils]: Spent 13.79s on a formula simplification. DAG size of input: 260 DAG size of output: 251 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 22:37:20,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 22:37:24,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 22:37:29,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:37:31,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:37:33,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:37:35,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:38:11,850 WARN L293 SmtUtils]: Spent 25.52s on a formula simplification. DAG size of input: 295 DAG size of output: 286 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 22:38:27,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-22 22:38:29,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15