./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68b0cda5422c6df9a05dd00f43cb56ae62ac5ef3a6cb82099875e56a3f490744 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:33:35,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:33:35,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:33:35,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:33:35,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:33:35,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:33:35,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:33:35,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:33:35,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:33:35,954 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:33:35,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:33:35,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:33:35,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:33:35,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:33:35,957 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:33:35,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:33:35,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:33:35,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:33:35,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:33:35,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:33:35,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:33:35,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:33:35,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:33:35,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:33:35,959 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:33:35,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:33:35,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:33:35,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:33:35,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:33:35,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:33:35,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:33:35,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:33:35,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:33:35,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:33:35,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:33:35,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:33:35,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:33:35,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:33:35,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:33:35,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:33:35,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:33:35,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:33:35,966 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 -> 68b0cda5422c6df9a05dd00f43cb56ae62ac5ef3a6cb82099875e56a3f490744 [2024-10-13 06:33:36,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:33:36,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:33:36,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:33:36,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:33:36,231 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:33:36,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i [2024-10-13 06:33:37,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:33:37,727 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:33:37,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i [2024-10-13 06:33:37,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0046ba1e/e5f068e387db4db6bf86d28f2b190721/FLAGbe8e345d7 [2024-10-13 06:33:38,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0046ba1e/e5f068e387db4db6bf86d28f2b190721 [2024-10-13 06:33:38,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:33:38,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:33:38,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:33:38,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:33:38,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:33:38,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471d631a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38, skipping insertion in model container [2024-10-13 06:33:38,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:33:38,308 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i[915,928] [2024-10-13 06:33:38,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:33:38,376 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:33:38,388 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i[915,928] [2024-10-13 06:33:38,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:33:38,432 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:33:38,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38 WrapperNode [2024-10-13 06:33:38,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:33:38,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:33:38,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:33:38,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:33:38,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,486 INFO L138 Inliner]: procedures = 29, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 342 [2024-10-13 06:33:38,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:33:38,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:33:38,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:33:38,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:33:38,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,521 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-10-13 06:33:38,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:33:38,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:33:38,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:33:38,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:33:38,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (1/1) ... [2024-10-13 06:33:38,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:33:38,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:38,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:33:38,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:33:38,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:33:38,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:33:38,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:33:38,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:33:38,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:33:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:33:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:33:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:33:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:33:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:33:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:33:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:33:38,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:33:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:33:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:33:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:33:38,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:33:38,752 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:33:38,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:33:39,141 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-10-13 06:33:39,141 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:33:39,171 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:33:39,173 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:33:39,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:39 BoogieIcfgContainer [2024-10-13 06:33:39,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:33:39,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:33:39,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:33:39,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:33:39,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:33:38" (1/3) ... [2024-10-13 06:33:39,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a91af3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:39, skipping insertion in model container [2024-10-13 06:33:39,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:38" (2/3) ... [2024-10-13 06:33:39,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a91af3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:39, skipping insertion in model container [2024-10-13 06:33:39,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:39" (3/3) ... [2024-10-13 06:33:39,183 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-9.i [2024-10-13 06:33:39,199 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:33:39,199 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:33:39,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:33:39,259 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1112d501, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:33:39,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:33:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 06:33:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:33:39,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:39,274 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:39,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:39,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:39,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1812120356, now seen corresponding path program 1 times [2024-10-13 06:33:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:39,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941174125] [2024-10-13 06:33:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:33:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:39,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941174125] [2024-10-13 06:33:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941174125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:39,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:39,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:33:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805348253] [2024-10-13 06:33:39,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:39,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:33:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:39,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:33:39,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:33:39,554 INFO L87 Difference]: Start difference. First operand has 69 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:33:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:39,581 INFO L93 Difference]: Finished difference Result 135 states and 203 transitions. [2024-10-13 06:33:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:33:39,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-10-13 06:33:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:39,590 INFO L225 Difference]: With dead ends: 135 [2024-10-13 06:33:39,591 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 06:33:39,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:33:39,599 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:39,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 06:33:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 06:33:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 06:33:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2024-10-13 06:33:39,674 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 57 [2024-10-13 06:33:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:39,692 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2024-10-13 06:33:39,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:33:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2024-10-13 06:33:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:33:39,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:39,694 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:39,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:33:39,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:39,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1544613482, now seen corresponding path program 1 times [2024-10-13 06:33:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342453207] [2024-10-13 06:33:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:39,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:33:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342453207] [2024-10-13 06:33:39,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342453207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:39,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:39,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512061840] [2024-10-13 06:33:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:39,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:39,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:39,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:39,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:39,924 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:39,971 INFO L93 Difference]: Finished difference Result 136 states and 193 transitions. [2024-10-13 06:33:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:39,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-13 06:33:39,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:39,973 INFO L225 Difference]: With dead ends: 136 [2024-10-13 06:33:39,973 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 06:33:39,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:39,974 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:39,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 257 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 06:33:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-13 06:33:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 06:33:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-10-13 06:33:39,988 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 57 [2024-10-13 06:33:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:39,989 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-10-13 06:33:39,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-10-13 06:33:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:33:39,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:39,993 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:39,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:33:39,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:39,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:39,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1151586472, now seen corresponding path program 1 times [2024-10-13 06:33:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338687389] [2024-10-13 06:33:39,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:33:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:40,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:40,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338687389] [2024-10-13 06:33:40,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338687389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:40,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:40,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641322683] [2024-10-13 06:33:40,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:40,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:40,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:40,148 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:40,193 INFO L93 Difference]: Finished difference Result 140 states and 197 transitions. [2024-10-13 06:33:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:40,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-13 06:33:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:40,200 INFO L225 Difference]: With dead ends: 140 [2024-10-13 06:33:40,200 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 06:33:40,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:40,201 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:40,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 258 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 06:33:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-13 06:33:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 06:33:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-10-13 06:33:40,213 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 57 [2024-10-13 06:33:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:40,215 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-10-13 06:33:40,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-10-13 06:33:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:33:40,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:40,217 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:40,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:33:40,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:40,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash 342239846, now seen corresponding path program 1 times [2024-10-13 06:33:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:40,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508854118] [2024-10-13 06:33:40,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:33:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:40,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:40,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508854118] [2024-10-13 06:33:40,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508854118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:40,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:40,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:33:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726353643] [2024-10-13 06:33:40,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:40,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:40,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:40,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:40,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:40,568 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:33:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:40,862 INFO L93 Difference]: Finished difference Result 259 states and 362 transitions. [2024-10-13 06:33:40,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:40,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-10-13 06:33:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:40,865 INFO L225 Difference]: With dead ends: 259 [2024-10-13 06:33:40,867 INFO L226 Difference]: Without dead ends: 189 [2024-10-13 06:33:40,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:40,868 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 286 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:40,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 301 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:33:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-13 06:33:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 137. [2024-10-13 06:33:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 124 states have (on average 1.3870967741935485) internal successors, (172), 124 states have internal predecessors, (172), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:33:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2024-10-13 06:33:40,884 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 57 [2024-10-13 06:33:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:40,885 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2024-10-13 06:33:40,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:33:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2024-10-13 06:33:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 06:33:40,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:40,888 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:40,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:33:40,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:40,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:40,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1379541321, now seen corresponding path program 1 times [2024-10-13 06:33:40,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:40,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629847481] [2024-10-13 06:33:40,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:40,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:41,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:33:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:41,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629847481] [2024-10-13 06:33:41,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629847481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:41,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:41,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:41,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979645233] [2024-10-13 06:33:41,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:41,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:41,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:41,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:41,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:41,009 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:41,049 INFO L93 Difference]: Finished difference Result 279 states and 391 transitions. [2024-10-13 06:33:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2024-10-13 06:33:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:41,051 INFO L225 Difference]: With dead ends: 279 [2024-10-13 06:33:41,051 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 06:33:41,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:41,056 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:41,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 260 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 06:33:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-10-13 06:33:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.375) internal successors, (176), 128 states have internal predecessors, (176), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:33:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2024-10-13 06:33:41,080 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 58 [2024-10-13 06:33:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:41,082 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2024-10-13 06:33:41,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2024-10-13 06:33:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 06:33:41,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:41,086 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:41,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:33:41,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:41,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1379481739, now seen corresponding path program 1 times [2024-10-13 06:33:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303681969] [2024-10-13 06:33:41,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:41,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:41,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:41,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:41,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:33:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:41,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:41,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303681969] [2024-10-13 06:33:41,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303681969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:41,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:41,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:41,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710682801] [2024-10-13 06:33:41,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:41,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:41,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:41,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:41,816 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:33:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:41,974 INFO L93 Difference]: Finished difference Result 286 states and 398 transitions. [2024-10-13 06:33:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:33:41,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-10-13 06:33:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:41,979 INFO L225 Difference]: With dead ends: 286 [2024-10-13 06:33:41,979 INFO L226 Difference]: Without dead ends: 146 [2024-10-13 06:33:41,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:33:41,981 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 46 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:41,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 272 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:41,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-13 06:33:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-10-13 06:33:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:33:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2024-10-13 06:33:41,994 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 58 [2024-10-13 06:33:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:41,995 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2024-10-13 06:33:41,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:33:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2024-10-13 06:33:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 06:33:41,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:41,997 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:41,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:33:41,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:41,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:41,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2058667265, now seen corresponding path program 1 times [2024-10-13 06:33:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:41,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928225385] [2024-10-13 06:33:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:33:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928225385] [2024-10-13 06:33:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928225385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:42,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:42,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:33:42,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244946317] [2024-10-13 06:33:42,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:42,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:42,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:42,289 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:33:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:42,498 INFO L93 Difference]: Finished difference Result 345 states and 474 transitions. [2024-10-13 06:33:42,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:42,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-13 06:33:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:42,500 INFO L225 Difference]: With dead ends: 345 [2024-10-13 06:33:42,500 INFO L226 Difference]: Without dead ends: 201 [2024-10-13 06:33:42,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:42,501 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 412 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:42,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 219 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:33:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-13 06:33:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 145. [2024-10-13 06:33:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.356060606060606) internal successors, (179), 132 states have internal predecessors, (179), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:33:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 199 transitions. [2024-10-13 06:33:42,521 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 199 transitions. Word has length 62 [2024-10-13 06:33:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:42,521 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 199 transitions. [2024-10-13 06:33:42,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:33:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 199 transitions. [2024-10-13 06:33:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 06:33:42,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:42,522 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:42,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:33:42,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:42,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1166507603, now seen corresponding path program 1 times [2024-10-13 06:33:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:42,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243717522] [2024-10-13 06:33:42,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:42,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:33:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:42,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:42,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243717522] [2024-10-13 06:33:42,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243717522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:42,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:42,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187392047] [2024-10-13 06:33:42,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:42,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:42,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:42,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:42,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:42,788 INFO L87 Difference]: Start difference. First operand 145 states and 199 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:42,951 INFO L93 Difference]: Finished difference Result 335 states and 458 transitions. [2024-10-13 06:33:42,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:42,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-10-13 06:33:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:42,953 INFO L225 Difference]: With dead ends: 335 [2024-10-13 06:33:42,953 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 06:33:42,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:42,954 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 180 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:42,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 237 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 06:33:42,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 135. [2024-10-13 06:33:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:33:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 184 transitions. [2024-10-13 06:33:42,967 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 184 transitions. Word has length 62 [2024-10-13 06:33:42,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:42,967 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 184 transitions. [2024-10-13 06:33:42,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 184 transitions. [2024-10-13 06:33:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 06:33:42,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:42,969 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:42,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:33:42,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:42,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1880683933, now seen corresponding path program 1 times [2024-10-13 06:33:42,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:42,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537963761] [2024-10-13 06:33:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:43,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928233220] [2024-10-13 06:33:43,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:43,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:43,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:43,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:33:43,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:33:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:33:43,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:33:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:33:43,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:33:43,406 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:33:43,407 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:33:43,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:33:43,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:43,612 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:43,654 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:33:43,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:33:43 BoogieIcfgContainer [2024-10-13 06:33:43,658 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:33:43,658 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:33:43,659 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:33:43,659 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:33:43,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:39" (3/4) ... [2024-10-13 06:33:43,663 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:33:43,664 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:33:43,665 INFO L158 Benchmark]: Toolchain (without parser) took 5569.84ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 131.1MB in the beginning and 131.0MB in the end (delta: 52.6kB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-10-13 06:33:43,665 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 82.1MB in the beginning and 82.0MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:33:43,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.67ms. Allocated memory is still 161.5MB. Free memory was 131.1MB in the beginning and 115.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 06:33:43,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.65ms. Allocated memory is still 161.5MB. Free memory was 115.6MB in the beginning and 112.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:33:43,666 INFO L158 Benchmark]: Boogie Preprocessor took 54.77ms. Allocated memory is still 161.5MB. Free memory was 111.4MB in the beginning and 108.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:33:43,666 INFO L158 Benchmark]: RCFGBuilder took 631.03ms. Allocated memory is still 161.5MB. Free memory was 108.3MB in the beginning and 78.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 06:33:43,667 INFO L158 Benchmark]: TraceAbstraction took 4482.52ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 77.8MB in the beginning and 132.1MB in the end (delta: -54.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:33:43,667 INFO L158 Benchmark]: Witness Printer took 5.50ms. Allocated memory is still 195.0MB. Free memory was 132.1MB in the beginning and 131.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:33:43,668 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 82.1MB in the beginning and 82.0MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.67ms. Allocated memory is still 161.5MB. Free memory was 131.1MB in the beginning and 115.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.65ms. Allocated memory is still 161.5MB. Free memory was 115.6MB in the beginning and 112.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.77ms. Allocated memory is still 161.5MB. Free memory was 111.4MB in the beginning and 108.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 631.03ms. Allocated memory is still 161.5MB. Free memory was 108.3MB in the beginning and 78.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4482.52ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 77.8MB in the beginning and 132.1MB in the end (delta: -54.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.50ms. Allocated memory is still 195.0MB. Free memory was 132.1MB in the beginning and 131.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of shiftLeft at line 95. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L45] unsigned char last_1_WrapperStruct0_var_1_1 = 10; [L46] double last_1_WrapperStruct0_var_1_10 = 9.2; [L47] signed short int last_1_WrapperStruct0_var_1_12 = 1; [L48] signed long int last_1_WrapperStruct0_var_1_14 = -16; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L89] EXPR WrapperStruct0.var_1_1 [L89] last_1_WrapperStruct0_var_1_1 = WrapperStruct0.var_1_1 [L90] EXPR WrapperStruct0.var_1_10 [L90] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L91] EXPR WrapperStruct0.var_1_12 [L91] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L92] EXPR WrapperStruct0.var_1_14 [L92] last_1_WrapperStruct0_var_1_14 = WrapperStruct0.var_1_14 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L79] WrapperStruct0.var_1_3 = __VERIFIER_nondet_uchar() [L80] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L80] CALL assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L80] RET assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L81] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L81] CALL assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L81] RET assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L82] WrapperStruct0.var_1_7 = __VERIFIER_nondet_uchar() [L83] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L83] CALL assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L83] RET assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L84] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L84] CALL assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L84] RET assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L85] WrapperStruct0.var_1_11 = __VERIFIER_nondet_double() [L86] EXPR WrapperStruct0.var_1_11 [L86] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F [L86] EXPR WrapperStruct0.var_1_11 [L86] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] CALL assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] RET assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L103] RET updateVariables() [L104] CALL step() [L52] unsigned char stepLocal_0 = last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10; VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10, stepLocal_0=0] [L53] COND FALSE !(((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || stepLocal_0) [L56] WrapperStruct0.var_1_12 = last_1_WrapperStruct0_var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L58] EXPR WrapperStruct0.var_1_12 [L58] WrapperStruct0.var_1_14 = WrapperStruct0.var_1_12 [L59] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L59] EXPR 10 << WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L59] EXPR WrapperStruct0.var_1_3 [L59] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L59] COND TRUE (10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14) [L60] EXPR WrapperStruct0.var_1_12 [L60] EXPR WrapperStruct0.var_1_14 [L60] WrapperStruct0.var_1_8 = (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14) [L62] WrapperStruct0.var_1_9 = 64 [L63] EXPR WrapperStruct0.var_1_11 [L63] WrapperStruct0.var_1_10 = WrapperStruct0.var_1_11 [L64] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L64] COND TRUE WrapperStruct0.var_1_12 <= 16 [L65] EXPR WrapperStruct0.var_1_3 [L65] WrapperStruct0.var_1_1 = WrapperStruct0.var_1_3 [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) [L95] EXPR WrapperStruct0.var_1_1 [L95] EXPR WrapperStruct0.var_1_3 [L95] EXPR (WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1) [L95] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR 10 << WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR WrapperStruct0.var_1_3 [L95] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1 [L95] EXPR WrapperStruct0.var_1_8 [L95] EXPR WrapperStruct0.var_1_12 [L95] EXPR WrapperStruct0.var_1_14 [L95] EXPR ((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64)) [L95] EXPR WrapperStruct0.var_1_9 [L95] EXPR (((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11)) [L95] EXPR WrapperStruct0.var_1_10 [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR ((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && (WrapperStruct0.var_1_14 == ((signed long int) WrapperStruct0.var_1_12)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && (WrapperStruct0.var_1_14 == ((signed long int) WrapperStruct0.var_1_12)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95-L96] return ((((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && (WrapperStruct0.var_1_14 == ((signed long int) WrapperStruct0.var_1_12)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L19] reach_error() VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 928 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 927 mSDsluCounter, 1895 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1325 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 705 IncrementalHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 570 mSDtfsCounter, 705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 169 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 320/320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 06:33:43,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68b0cda5422c6df9a05dd00f43cb56ae62ac5ef3a6cb82099875e56a3f490744 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:33:45,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:33:45,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:33:45,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:33:45,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:33:45,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:33:45,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:33:45,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:33:45,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:33:45,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:33:45,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:33:45,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:33:45,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:33:45,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:33:45,918 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:33:45,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:33:45,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:33:45,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:33:45,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:33:45,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:33:45,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:33:45,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:33:45,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:33:45,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:33:45,923 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:33:45,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:33:45,923 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:33:45,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:33:45,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:33:45,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:33:45,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:33:45,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:33:45,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:33:45,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:33:45,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:33:45,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:33:45,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:33:45,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:33:45,925 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:33:45,925 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:33:45,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:33:45,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:33:45,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:33:45,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:33:45,927 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:33:45,927 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 -> 68b0cda5422c6df9a05dd00f43cb56ae62ac5ef3a6cb82099875e56a3f490744 [2024-10-13 06:33:46,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:33:46,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:33:46,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:33:46,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:33:46,247 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:33:46,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i [2024-10-13 06:33:47,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:33:47,886 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:33:47,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i [2024-10-13 06:33:47,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe2b74fa/53589504445147dcb52765424361c576/FLAGf42286dbc [2024-10-13 06:33:47,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe2b74fa/53589504445147dcb52765424361c576 [2024-10-13 06:33:47,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:33:47,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:33:47,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:33:47,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:33:47,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:33:47,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:33:47" (1/1) ... [2024-10-13 06:33:47,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef4d648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:47, skipping insertion in model container [2024-10-13 06:33:47,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:33:47" (1/1) ... [2024-10-13 06:33:47,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:33:48,100 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i[915,928] [2024-10-13 06:33:48,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:33:48,179 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:33:48,192 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i[915,928] [2024-10-13 06:33:48,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:33:48,273 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:33:48,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48 WrapperNode [2024-10-13 06:33:48,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:33:48,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:33:48,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:33:48,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:33:48,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,337 INFO L138 Inliner]: procedures = 36, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 328 [2024-10-13 06:33:48,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:33:48,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:33:48,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:33:48,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:33:48,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,395 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-10-13 06:33:48,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:33:48,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:33:48,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:33:48,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:33:48,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (1/1) ... [2024-10-13 06:33:48,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:33:48,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:48,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:33:48,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:33:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:33:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:33:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:33:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:33:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:33:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:33:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:33:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:33:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:33:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:33:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:33:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:33:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:33:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:33:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:33:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:33:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:33:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:33:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:33:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:33:48,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:33:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:33:48,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:33:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:33:48,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:33:48,626 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:33:48,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:33:49,177 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-10-13 06:33:49,177 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:33:49,226 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:33:49,226 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:33:49,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:49 BoogieIcfgContainer [2024-10-13 06:33:49,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:33:49,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:33:49,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:33:49,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:33:49,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:33:47" (1/3) ... [2024-10-13 06:33:49,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3178af2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:49, skipping insertion in model container [2024-10-13 06:33:49,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:48" (2/3) ... [2024-10-13 06:33:49,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3178af2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:49, skipping insertion in model container [2024-10-13 06:33:49,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:49" (3/3) ... [2024-10-13 06:33:49,235 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-9.i [2024-10-13 06:33:49,250 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:33:49,250 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:33:49,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:33:49,328 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f9203bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:33:49,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:33:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 06:33:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 06:33:49,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:49,342 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:49,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:49,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1101514449, now seen corresponding path program 1 times [2024-10-13 06:33:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:49,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235946257] [2024-10-13 06:33:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:49,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:49,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:49,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:33:49,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 06:33:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:33:49,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 06:33:49,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:49,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:49,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235946257] [2024-10-13 06:33:49,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235946257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:49,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:49,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:33:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568607243] [2024-10-13 06:33:49,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:49,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:33:49,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:33:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:33:49,594 INFO L87 Difference]: Start difference. First operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:33:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:49,627 INFO L93 Difference]: Finished difference Result 123 states and 187 transitions. [2024-10-13 06:33:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:33:49,629 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-10-13 06:33:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:49,634 INFO L225 Difference]: With dead ends: 123 [2024-10-13 06:33:49,635 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 06:33:49,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:33:49,639 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:49,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 06:33:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-13 06:33:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 06:33:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-10-13 06:33:49,673 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 55 [2024-10-13 06:33:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:49,674 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-10-13 06:33:49,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:33:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-10-13 06:33:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 06:33:49,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:49,680 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:49,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 06:33:49,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:49,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:49,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:49,886 INFO L85 PathProgramCache]: Analyzing trace with hash 6585845, now seen corresponding path program 1 times [2024-10-13 06:33:49,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:49,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060866043] [2024-10-13 06:33:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:49,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:49,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:49,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:33:49,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 06:33:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:33:50,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:50,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:50,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:50,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060866043] [2024-10-13 06:33:50,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060866043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:50,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:50,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:50,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47803214] [2024-10-13 06:33:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:50,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:50,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:50,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:50,092 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:50,139 INFO L93 Difference]: Finished difference Result 124 states and 177 transitions. [2024-10-13 06:33:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:50,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2024-10-13 06:33:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:50,145 INFO L225 Difference]: With dead ends: 124 [2024-10-13 06:33:50,145 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 06:33:50,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:50,146 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:50,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 233 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 06:33:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-10-13 06:33:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 06:33:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2024-10-13 06:33:50,154 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 55 [2024-10-13 06:33:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:50,155 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2024-10-13 06:33:50,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2024-10-13 06:33:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 06:33:50,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:50,157 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:50,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 06:33:50,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:50,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:50,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:50,358 INFO L85 PathProgramCache]: Analyzing trace with hash -386441165, now seen corresponding path program 1 times [2024-10-13 06:33:50,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:50,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097233838] [2024-10-13 06:33:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:50,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:50,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:50,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:33:50,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 06:33:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:33:50,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:50,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:50,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:50,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097233838] [2024-10-13 06:33:50,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097233838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:50,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:50,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223827627] [2024-10-13 06:33:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:50,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:50,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:50,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:50,555 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:50,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:50,614 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2024-10-13 06:33:50,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:50,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2024-10-13 06:33:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:50,616 INFO L225 Difference]: With dead ends: 128 [2024-10-13 06:33:50,616 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 06:33:50,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:50,617 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:50,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 303 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 06:33:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-13 06:33:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 06:33:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-10-13 06:33:50,622 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 55 [2024-10-13 06:33:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:50,623 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-10-13 06:33:50,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-10-13 06:33:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 06:33:50,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:50,628 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:50,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 06:33:50,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:50,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:50,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:50,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1195787791, now seen corresponding path program 1 times [2024-10-13 06:33:50,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:50,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293350618] [2024-10-13 06:33:50,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:50,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:50,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:50,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:33:50,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 06:33:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:33:50,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:33:51,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:51,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:51,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293350618] [2024-10-13 06:33:51,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293350618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:51,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:51,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:33:51,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879086303] [2024-10-13 06:33:51,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:51,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:51,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:51,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:51,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:51,020 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:51,108 INFO L93 Difference]: Finished difference Result 134 states and 188 transitions. [2024-10-13 06:33:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:51,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2024-10-13 06:33:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:51,114 INFO L225 Difference]: With dead ends: 134 [2024-10-13 06:33:51,114 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 06:33:51,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:51,116 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:51,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 06:33:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-13 06:33:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 06:33:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2024-10-13 06:33:51,125 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 55 [2024-10-13 06:33:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:51,125 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2024-10-13 06:33:51,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:33:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2024-10-13 06:33:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 06:33:51,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:51,126 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:51,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:51,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:51,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:51,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:51,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1195728209, now seen corresponding path program 1 times [2024-10-13 06:33:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:51,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653881984] [2024-10-13 06:33:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:51,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:51,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:51,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:33:51,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 06:33:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:51,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 06:33:51,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:51,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:33:51,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 06:33:51,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2024-10-13 06:33:54,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:54,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-10-13 06:33:54,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:54,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-10-13 06:33:54,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:54,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 73 [2024-10-13 06:33:54,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:54,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 96 [2024-10-13 06:33:55,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:55,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 97 treesize of output 120 [2024-10-13 06:33:55,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:55,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 137 treesize of output 59 [2024-10-13 06:33:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 06:33:55,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:55,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:55,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653881984] [2024-10-13 06:33:55,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653881984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:55,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:55,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:33:55,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483126932] [2024-10-13 06:33:55,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:55,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:33:55,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:55,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:33:55,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=46, Unknown=1, NotChecked=0, Total=72 [2024-10-13 06:33:55,361 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 06:33:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:57,084 INFO L93 Difference]: Finished difference Result 205 states and 283 transitions. [2024-10-13 06:33:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:33:57,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2024-10-13 06:33:57,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:57,086 INFO L225 Difference]: With dead ends: 205 [2024-10-13 06:33:57,087 INFO L226 Difference]: Without dead ends: 137 [2024-10-13 06:33:57,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=41, Invalid=68, Unknown=1, NotChecked=0, Total=110 [2024-10-13 06:33:57,088 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 231 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:57,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 318 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 06:33:57,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-13 06:33:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 79. [2024-10-13 06:33:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 06:33:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2024-10-13 06:33:57,107 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 55 [2024-10-13 06:33:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:57,109 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2024-10-13 06:33:57,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 06:33:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2024-10-13 06:33:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 06:33:57,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:57,110 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:57,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:57,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:57,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:57,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1105094381, now seen corresponding path program 1 times [2024-10-13 06:33:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511060716] [2024-10-13 06:33:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:57,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:33:57,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:57,314 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:33:57,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 06:33:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:57,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 06:33:57,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:57,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-13 06:33:57,505 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 17 treesize of output 9 [2024-10-13 06:33:57,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 06:33:57,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2024-10-13 06:34:00,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:00,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2024-10-13 06:34:00,571 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 64 treesize of output 66 [2024-10-13 06:34:00,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:00,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 113 treesize of output 123 [2024-10-13 06:34:00,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:00,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 136 treesize of output 141 [2024-10-13 06:34:01,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:01,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 175 treesize of output 85 [2024-10-13 06:34:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 06:34:01,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:01,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:01,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511060716] [2024-10-13 06:34:01,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511060716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:01,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:01,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:34:01,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858765834] [2024-10-13 06:34:01,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:01,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:34:01,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:01,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:34:01,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=117, Unknown=1, NotChecked=0, Total=156 [2024-10-13 06:34:01,207 INFO L87 Difference]: Start difference. First operand 79 states and 110 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 06:34:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:03,969 INFO L93 Difference]: Finished difference Result 329 states and 456 transitions. [2024-10-13 06:34:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:34:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2024-10-13 06:34:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:03,972 INFO L225 Difference]: With dead ends: 329 [2024-10-13 06:34:03,972 INFO L226 Difference]: Without dead ends: 251 [2024-10-13 06:34:03,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=117, Invalid=262, Unknown=1, NotChecked=0, Total=380 [2024-10-13 06:34:03,974 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 383 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:03,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 433 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 06:34:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-13 06:34:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 145. [2024-10-13 06:34:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.378787878787879) internal successors, (182), 132 states have internal predecessors, (182), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 06:34:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 202 transitions. [2024-10-13 06:34:03,998 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 202 transitions. Word has length 55 [2024-10-13 06:34:03,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:03,998 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 202 transitions. [2024-10-13 06:34:03,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 06:34:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 202 transitions. [2024-10-13 06:34:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:34:04,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:04,000 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:04,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 06:34:04,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:04,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:04,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1497772152, now seen corresponding path program 1 times [2024-10-13 06:34:04,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:04,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887861626] [2024-10-13 06:34:04,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:04,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:04,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:04,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:04,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 06:34:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:04,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 06:34:04,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:04,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2024-10-13 06:34:04,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:04,854 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 142 treesize of output 63 [2024-10-13 06:34:04,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:04,899 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 142 treesize of output 63 [2024-10-13 06:34:04,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:04,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 96 [2024-10-13 06:34:05,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:05,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 203 treesize of output 156 [2024-10-13 06:34:05,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:05,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 222 treesize of output 165 [2024-10-13 06:34:05,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:05,661 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 412 treesize of output 154 [2024-10-13 06:34:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 06:34:05,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:34:05,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887861626] [2024-10-13 06:34:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887861626] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:34:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1139174223] [2024-10-13 06:34:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:05,989 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:34:05,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:34:05,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:34:05,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-13 06:34:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:07,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 06:34:07,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:07,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-13 06:34:07,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:07,841 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 120 treesize of output 63 [2024-10-13 06:34:07,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:07,925 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 120 treesize of output 63 [2024-10-13 06:34:08,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:08,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 90 [2024-10-13 06:34:08,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:08,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 176 treesize of output 136 [2024-10-13 06:34:08,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:08,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 69 treesize of output 75 [2024-10-13 06:34:08,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:08,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 211 treesize of output 87 [2024-10-13 06:34:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 06:34:08,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:34:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1139174223] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:34:08,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:34:08,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-10-13 06:34:08,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384523828] [2024-10-13 06:34:08,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:34:08,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 06:34:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:08,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 06:34:08,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-13 06:34:08,860 INFO L87 Difference]: Start difference. First operand 145 states and 202 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 17 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-13 06:34:15,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:15,613 INFO L93 Difference]: Finished difference Result 531 states and 732 transitions. [2024-10-13 06:34:15,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:34:15,614 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 17 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 57 [2024-10-13 06:34:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:15,616 INFO L225 Difference]: With dead ends: 531 [2024-10-13 06:34:15,616 INFO L226 Difference]: Without dead ends: 387 [2024-10-13 06:34:15,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2024-10-13 06:34:15,621 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 594 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:15,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 375 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-13 06:34:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-13 06:34:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 379. [2024-10-13 06:34:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 344 states have (on average 1.3575581395348837) internal successors, (467), 348 states have internal predecessors, (467), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 06:34:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 523 transitions. [2024-10-13 06:34:15,677 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 523 transitions. Word has length 57 [2024-10-13 06:34:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:15,677 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 523 transitions. [2024-10-13 06:34:15,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 17 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-13 06:34:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 523 transitions. [2024-10-13 06:34:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:34:15,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:15,682 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:15,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-13 06:34:15,892 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 [2024-10-13 06:34:16,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:16,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 688425526, now seen corresponding path program 1 times [2024-10-13 06:34:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65492903] [2024-10-13 06:34:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:16,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:16,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:16,086 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:16,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 06:34:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:16,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 06:34:16,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:16,272 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 36 treesize of output 10 [2024-10-13 06:34:16,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 06:34:16,301 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 40 treesize of output 22 [2024-10-13 06:34:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:34:16,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:16,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:16,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65492903] [2024-10-13 06:34:16,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65492903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:16,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:16,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:34:16,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791093075] [2024-10-13 06:34:16,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:16,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:34:16,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:16,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:34:16,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:34:16,320 INFO L87 Difference]: Start difference. First operand 379 states and 523 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:16,659 INFO L93 Difference]: Finished difference Result 806 states and 1110 transitions. [2024-10-13 06:34:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:34:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-13 06:34:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:16,664 INFO L225 Difference]: With dead ends: 806 [2024-10-13 06:34:16,665 INFO L226 Difference]: Without dead ends: 428 [2024-10-13 06:34:16,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:34:16,667 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 68 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:16,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 241 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:34:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-13 06:34:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 405. [2024-10-13 06:34:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 362 states have (on average 1.3342541436464088) internal successors, (483), 368 states have internal predecessors, (483), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:34:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 551 transitions. [2024-10-13 06:34:16,711 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 551 transitions. Word has length 57 [2024-10-13 06:34:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:16,712 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 551 transitions. [2024-10-13 06:34:16,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 551 transitions. [2024-10-13 06:34:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:34:16,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:16,713 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:16,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 06:34:16,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:16,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:16,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash 295398516, now seen corresponding path program 1 times [2024-10-13 06:34:16,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:16,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606730119] [2024-10-13 06:34:16,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:16,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:16,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:16,921 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:16,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 06:34:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:17,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 06:34:17,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:17,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 06:34:17,174 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 16 treesize of output 12 [2024-10-13 06:34:17,180 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 32 treesize of output 25 [2024-10-13 06:34:17,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:17,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-10-13 06:34:17,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:17,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 60 [2024-10-13 06:34:17,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:17,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 63 [2024-10-13 06:34:17,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:17,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 59 [2024-10-13 06:34:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:34:17,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:17,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:17,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606730119] [2024-10-13 06:34:17,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606730119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:17,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:17,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:34:17,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539421694] [2024-10-13 06:34:17,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:17,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:34:17,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:17,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:34:17,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:34:17,368 INFO L87 Difference]: Start difference. First operand 405 states and 551 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:18,725 INFO L93 Difference]: Finished difference Result 1103 states and 1502 transitions. [2024-10-13 06:34:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 06:34:18,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-13 06:34:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:18,733 INFO L225 Difference]: With dead ends: 1103 [2024-10-13 06:34:18,733 INFO L226 Difference]: Without dead ends: 725 [2024-10-13 06:34:18,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2024-10-13 06:34:18,735 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 409 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:18,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 489 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 06:34:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-13 06:34:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 548. [2024-10-13 06:34:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 493 states have (on average 1.3204868154158216) internal successors, (651), 500 states have internal predecessors, (651), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 37 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:34:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 739 transitions. [2024-10-13 06:34:18,805 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 739 transitions. Word has length 57 [2024-10-13 06:34:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:18,806 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 739 transitions. [2024-10-13 06:34:18,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 739 transitions. [2024-10-13 06:34:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:34:18,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:18,810 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:18,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 06:34:19,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:19,011 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:19,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 680123702, now seen corresponding path program 1 times [2024-10-13 06:34:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640454379] [2024-10-13 06:34:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:19,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:19,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:19,015 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:19,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 06:34:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:19,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 06:34:19,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:19,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:19,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 31 [2024-10-13 06:34:19,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:19,293 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 45 treesize of output 41 [2024-10-13 06:34:19,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:19,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2024-10-13 06:34:21,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:21,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 56 [2024-10-13 06:34:23,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:23,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 66 [2024-10-13 06:34:24,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 99 [2024-10-13 06:34:24,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:24,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 113 [2024-10-13 06:34:24,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:24,325 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 158 treesize of output 68 [2024-10-13 06:34:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 06:34:24,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:24,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:24,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640454379] [2024-10-13 06:34:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640454379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:24,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:24,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:34:24,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490444954] [2024-10-13 06:34:24,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:24,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:34:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:24,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:34:24,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=114, Unknown=2, NotChecked=0, Total=156 [2024-10-13 06:34:24,374 INFO L87 Difference]: Start difference. First operand 548 states and 739 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 06:34:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:26,131 INFO L93 Difference]: Finished difference Result 1081 states and 1456 transitions. [2024-10-13 06:34:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:34:26,134 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2024-10-13 06:34:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:26,137 INFO L225 Difference]: With dead ends: 1081 [2024-10-13 06:34:26,137 INFO L226 Difference]: Without dead ends: 560 [2024-10-13 06:34:26,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=106, Invalid=234, Unknown=2, NotChecked=0, Total=342 [2024-10-13 06:34:26,139 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 180 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:26,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 532 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 06:34:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-13 06:34:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 536. [2024-10-13 06:34:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 481 states have (on average 1.3076923076923077) internal successors, (629), 488 states have internal predecessors, (629), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 37 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:34:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 717 transitions. [2024-10-13 06:34:26,190 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 717 transitions. Word has length 57 [2024-10-13 06:34:26,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:26,191 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 717 transitions. [2024-10-13 06:34:26,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 06:34:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 717 transitions. [2024-10-13 06:34:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:34:26,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:26,192 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:26,200 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 (12)] Ended with exit code 0 [2024-10-13 06:34:26,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:26,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:26,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:26,393 INFO L85 PathProgramCache]: Analyzing trace with hash -522249934, now seen corresponding path program 1 times [2024-10-13 06:34:26,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:26,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387586312] [2024-10-13 06:34:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:26,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:26,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:26,394 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:26,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 06:34:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:26,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 06:34:26,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:26,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-13 06:34:26,599 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 17 treesize of output 9 [2024-10-13 06:34:26,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 06:34:26,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-13 06:34:29,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:29,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2024-10-13 06:34:29,324 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 54 treesize of output 53 [2024-10-13 06:34:29,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:29,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 121 treesize of output 77 [2024-10-13 06:34:29,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:29,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 77 [2024-10-13 06:34:29,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:29,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 109 treesize of output 43 [2024-10-13 06:34:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 06:34:29,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:29,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:29,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387586312] [2024-10-13 06:34:29,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387586312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:29,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:29,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:34:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960375753] [2024-10-13 06:34:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:29,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:34:29,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:29,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:34:29,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2024-10-13 06:34:29,719 INFO L87 Difference]: Start difference. First operand 536 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 06:34:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:31,970 INFO L93 Difference]: Finished difference Result 1248 states and 1670 transitions. [2024-10-13 06:34:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:34:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2024-10-13 06:34:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:31,973 INFO L225 Difference]: With dead ends: 1248 [2024-10-13 06:34:31,973 INFO L226 Difference]: Without dead ends: 739 [2024-10-13 06:34:31,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=61, Invalid=120, Unknown=1, NotChecked=0, Total=182 [2024-10-13 06:34:31,975 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 392 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:31,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 296 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 06:34:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-10-13 06:34:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 553. [2024-10-13 06:34:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 498 states have (on average 1.3092369477911647) internal successors, (652), 505 states have internal predecessors, (652), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 37 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:34:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 740 transitions. [2024-10-13 06:34:32,028 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 740 transitions. Word has length 57 [2024-10-13 06:34:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:32,028 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 740 transitions. [2024-10-13 06:34:32,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 06:34:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 740 transitions. [2024-10-13 06:34:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:34:32,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:32,030 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:32,042 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 (13)] Ended with exit code 0 [2024-10-13 06:34:32,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:32,231 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:32,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash 93317688, now seen corresponding path program 1 times [2024-10-13 06:34:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308088363] [2024-10-13 06:34:32,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:32,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:32,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:32,233 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:32,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 06:34:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:32,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 06:34:32,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:32,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2024-10-13 06:34:32,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:32,769 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 142 treesize of output 63 [2024-10-13 06:34:32,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:32,787 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 142 treesize of output 63 [2024-10-13 06:34:32,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:32,818 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 211 treesize of output 104 [2024-10-13 06:34:32,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:32,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 119 [2024-10-13 06:34:33,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:33,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 360 treesize of output 144 [2024-10-13 06:34:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 06:34:33,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:34:33,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:33,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308088363] [2024-10-13 06:34:33,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308088363] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:34:33,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1584749624] [2024-10-13 06:34:33,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:33,495 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:34:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:34:33,496 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:34:33,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-13 06:34:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:34,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 06:34:34,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:34,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-13 06:34:35,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:35,131 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 120 treesize of output 63 [2024-10-13 06:34:35,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:35,214 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 120 treesize of output 63 [2024-10-13 06:34:35,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:35,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 108 [2024-10-13 06:34:35,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:35,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 162 treesize of output 126 [2024-10-13 06:34:35,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:35,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 304 treesize of output 152 [2024-10-13 06:34:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 06:34:35,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:34:36,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1584749624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:34:36,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:34:36,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-13 06:34:36,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842615466] [2024-10-13 06:34:36,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:34:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 06:34:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 06:34:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:34:36,030 INFO L87 Difference]: Start difference. First operand 553 states and 740 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-13 06:34:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:38,459 INFO L93 Difference]: Finished difference Result 1096 states and 1458 transitions. [2024-10-13 06:34:38,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:34:38,461 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 57 [2024-10-13 06:34:38,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:38,463 INFO L225 Difference]: With dead ends: 1096 [2024-10-13 06:34:38,464 INFO L226 Difference]: Without dead ends: 570 [2024-10-13 06:34:38,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-10-13 06:34:38,465 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 310 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:38,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 278 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 06:34:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-13 06:34:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 455. [2024-10-13 06:34:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 415 states have (on average 1.3204819277108433) internal successors, (548), 418 states have internal predecessors, (548), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:34:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 608 transitions. [2024-10-13 06:34:38,515 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 608 transitions. Word has length 57 [2024-10-13 06:34:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:38,516 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 608 transitions. [2024-10-13 06:34:38,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-13 06:34:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 608 transitions. [2024-10-13 06:34:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:34:38,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:38,517 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:38,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-10-13 06:34:38,725 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 (14)] Ended with exit code 0 [2024-10-13 06:34:38,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:38,918 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:38,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash 778787762, now seen corresponding path program 1 times [2024-10-13 06:34:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567186639] [2024-10-13 06:34:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:38,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:38,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:38,920 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:38,924 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 (16)] Waiting until timeout for monitored process [2024-10-13 06:34:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:39,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:34:39,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:39,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:39,077 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 37 treesize of output 17 [2024-10-13 06:34:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:34:39,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:39,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567186639] [2024-10-13 06:34:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567186639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:39,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:39,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:34:39,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463751467] [2024-10-13 06:34:39,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:39,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:34:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:39,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:34:39,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:34:39,185 INFO L87 Difference]: Start difference. First operand 455 states and 608 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:39,616 INFO L93 Difference]: Finished difference Result 1105 states and 1466 transitions. [2024-10-13 06:34:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:34:39,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-13 06:34:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:39,618 INFO L225 Difference]: With dead ends: 1105 [2024-10-13 06:34:39,618 INFO L226 Difference]: Without dead ends: 651 [2024-10-13 06:34:39,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:34:39,620 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 76 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:39,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 224 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:34:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-10-13 06:34:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 589. [2024-10-13 06:34:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 541 states have (on average 1.3160813308687616) internal successors, (712), 544 states have internal predecessors, (712), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:34:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 784 transitions. [2024-10-13 06:34:39,678 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 784 transitions. Word has length 57 [2024-10-13 06:34:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:39,678 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 784 transitions. [2024-10-13 06:34:39,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 784 transitions. [2024-10-13 06:34:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 06:34:39,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:39,679 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:39,689 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 (16)] Forceful destruction successful, exit code 0 [2024-10-13 06:34:39,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:39,880 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:39,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2095595270, now seen corresponding path program 1 times [2024-10-13 06:34:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:39,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259734244] [2024-10-13 06:34:39,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:39,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:39,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:39,883 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:39,884 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 (17)] Waiting until timeout for monitored process [2024-10-13 06:34:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:40,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:34:40,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 06:34:40,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:40,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:40,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259734244] [2024-10-13 06:34:40,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259734244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:40,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:40,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:34:40,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484891035] [2024-10-13 06:34:40,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:40,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:34:40,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:40,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:34:40,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:34:40,032 INFO L87 Difference]: Start difference. First operand 589 states and 784 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:34:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:40,124 INFO L93 Difference]: Finished difference Result 1102 states and 1468 transitions. [2024-10-13 06:34:40,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:34:40,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-10-13 06:34:40,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:40,127 INFO L225 Difference]: With dead ends: 1102 [2024-10-13 06:34:40,127 INFO L226 Difference]: Without dead ends: 589 [2024-10-13 06:34:40,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:34:40,128 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:40,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:34:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-10-13 06:34:40,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2024-10-13 06:34:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 541 states have (on average 1.3086876155268021) internal successors, (708), 544 states have internal predecessors, (708), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:34:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 780 transitions. [2024-10-13 06:34:40,182 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 780 transitions. Word has length 57 [2024-10-13 06:34:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:40,183 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 780 transitions. [2024-10-13 06:34:40,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:34:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 780 transitions. [2024-10-13 06:34:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 06:34:40,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:40,184 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:40,191 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 (17)] Ended with exit code 0 [2024-10-13 06:34:40,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:40,384 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:40,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:40,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1396214344, now seen corresponding path program 1 times [2024-10-13 06:34:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:40,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013932325] [2024-10-13 06:34:40,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:40,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:40,389 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:40,394 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 (18)] Waiting until timeout for monitored process [2024-10-13 06:34:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:40,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 06:34:40,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:40,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 06:34:40,618 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 16 treesize of output 12 [2024-10-13 06:34:40,624 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 32 treesize of output 25 [2024-10-13 06:34:40,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:40,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-10-13 06:34:40,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:40,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 78 [2024-10-13 06:34:40,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:40,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 87 [2024-10-13 06:34:41,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:41,250 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 110 treesize of output 50 [2024-10-13 06:34:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:34:41,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:41,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:41,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013932325] [2024-10-13 06:34:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013932325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:41,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:41,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:34:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693827221] [2024-10-13 06:34:41,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:34:41,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:41,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:34:41,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:34:41,284 INFO L87 Difference]: Start difference. First operand 589 states and 780 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:43,206 INFO L93 Difference]: Finished difference Result 729 states and 967 transitions. [2024-10-13 06:34:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:34:43,206 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-13 06:34:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:43,209 INFO L225 Difference]: With dead ends: 729 [2024-10-13 06:34:43,209 INFO L226 Difference]: Without dead ends: 727 [2024-10-13 06:34:43,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2024-10-13 06:34:43,210 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 371 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:43,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 443 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 06:34:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-13 06:34:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 597. [2024-10-13 06:34:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 549 states have (on average 1.3041894353369763) internal successors, (716), 552 states have internal predecessors, (716), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:34:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 788 transitions. [2024-10-13 06:34:43,269 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 788 transitions. Word has length 59 [2024-10-13 06:34:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:43,269 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 788 transitions. [2024-10-13 06:34:43,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 788 transitions. [2024-10-13 06:34:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 06:34:43,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:43,270 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:43,279 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 (18)] Forceful destruction successful, exit code 0 [2024-10-13 06:34:43,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:43,471 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:43,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1396273926, now seen corresponding path program 1 times [2024-10-13 06:34:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:43,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290378300] [2024-10-13 06:34:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:43,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:43,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:43,478 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:43,480 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 (19)] Waiting until timeout for monitored process [2024-10-13 06:34:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:43,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 06:34:43,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:43,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 06:34:43,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 06:34:43,748 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 32 treesize of output 25 [2024-10-13 06:34:43,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:43,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2024-10-13 06:34:43,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:43,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 48 [2024-10-13 06:34:43,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:43,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 48 [2024-10-13 06:34:44,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:44,075 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 89 treesize of output 53 [2024-10-13 06:34:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:34:44,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:44,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:44,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290378300] [2024-10-13 06:34:44,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290378300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:44,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:44,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:34:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578045795] [2024-10-13 06:34:44,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:44,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:34:44,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:34:44,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:34:44,108 INFO L87 Difference]: Start difference. First operand 597 states and 788 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:46,013 INFO L93 Difference]: Finished difference Result 1199 states and 1588 transitions. [2024-10-13 06:34:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:34:46,014 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-13 06:34:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:46,016 INFO L225 Difference]: With dead ends: 1199 [2024-10-13 06:34:46,016 INFO L226 Difference]: Without dead ends: 737 [2024-10-13 06:34:46,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:34:46,018 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 380 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:46,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 465 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 06:34:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-13 06:34:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 609. [2024-10-13 06:34:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 561 states have (on average 1.2976827094474153) internal successors, (728), 564 states have internal predecessors, (728), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:34:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 800 transitions. [2024-10-13 06:34:46,076 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 800 transitions. Word has length 59 [2024-10-13 06:34:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:46,076 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 800 transitions. [2024-10-13 06:34:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 800 transitions. [2024-10-13 06:34:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 06:34:46,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:46,077 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:46,087 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 (19)] Forceful destruction successful, exit code 0 [2024-10-13 06:34:46,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:46,278 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:46,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2086572569, now seen corresponding path program 1 times [2024-10-13 06:34:46,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:46,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080918815] [2024-10-13 06:34:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:46,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:46,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:46,280 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:46,281 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 (20)] Waiting until timeout for monitored process [2024-10-13 06:34:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:46,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:34:46,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:46,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:46,438 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 103 treesize of output 31 [2024-10-13 06:34:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:34:46,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:46,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:46,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080918815] [2024-10-13 06:34:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080918815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:46,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:46,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:34:46,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876942364] [2024-10-13 06:34:46,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:46,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:34:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:34:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:34:46,453 INFO L87 Difference]: Start difference. First operand 609 states and 800 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:46,528 INFO L93 Difference]: Finished difference Result 1147 states and 1504 transitions. [2024-10-13 06:34:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:34:46,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-13 06:34:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:46,534 INFO L225 Difference]: With dead ends: 1147 [2024-10-13 06:34:46,534 INFO L226 Difference]: Without dead ends: 609 [2024-10-13 06:34:46,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:34:46,535 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:46,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:34:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-10-13 06:34:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-10-13 06:34:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 561 states have (on average 1.2762923351158646) internal successors, (716), 564 states have internal predecessors, (716), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:34:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 788 transitions. [2024-10-13 06:34:46,587 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 788 transitions. Word has length 59 [2024-10-13 06:34:46,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:46,587 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 788 transitions. [2024-10-13 06:34:46,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 788 transitions. [2024-10-13 06:34:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 06:34:46,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:46,588 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:46,594 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 (20)] Ended with exit code 0 [2024-10-13 06:34:46,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:46,789 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:46,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash 620046825, now seen corresponding path program 1 times [2024-10-13 06:34:46,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:46,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962887097] [2024-10-13 06:34:46,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:46,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:46,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:46,792 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:46,796 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 (21)] Waiting until timeout for monitored process [2024-10-13 06:34:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:46,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 06:34:46,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:47,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:34:47,013 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 15 [2024-10-13 06:34:47,022 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 22 treesize of output 10 [2024-10-13 06:34:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 06:34:47,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:47,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962887097] [2024-10-13 06:34:47,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962887097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:47,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:47,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:34:47,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626863212] [2024-10-13 06:34:47,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:47,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:34:47,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:47,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:34:47,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:34:47,112 INFO L87 Difference]: Start difference. First operand 609 states and 788 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:47,624 INFO L93 Difference]: Finished difference Result 1357 states and 1746 transitions. [2024-10-13 06:34:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:34:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-13 06:34:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:47,628 INFO L225 Difference]: With dead ends: 1357 [2024-10-13 06:34:47,629 INFO L226 Difference]: Without dead ends: 815 [2024-10-13 06:34:47,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:34:47,630 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 58 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:47,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 212 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:34:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-10-13 06:34:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 583. [2024-10-13 06:34:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 535 states have (on average 1.2598130841121495) internal successors, (674), 538 states have internal predecessors, (674), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:34:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 746 transitions. [2024-10-13 06:34:47,684 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 746 transitions. Word has length 59 [2024-10-13 06:34:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:47,684 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 746 transitions. [2024-10-13 06:34:47,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 06:34:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 746 transitions. [2024-10-13 06:34:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 06:34:47,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:47,686 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:47,695 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 (21)] Ended with exit code 0 [2024-10-13 06:34:47,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:47,890 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:47,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:47,890 INFO L85 PathProgramCache]: Analyzing trace with hash -844961412, now seen corresponding path program 1 times [2024-10-13 06:34:47,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153673438] [2024-10-13 06:34:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:47,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:47,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:47,893 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:47,894 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 (22)] Waiting until timeout for monitored process [2024-10-13 06:34:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:48,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:34:48,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 06:34:48,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:48,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:48,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153673438] [2024-10-13 06:34:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153673438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:48,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:34:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836670452] [2024-10-13 06:34:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:48,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:34:48,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:48,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:34:48,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:34:48,055 INFO L87 Difference]: Start difference. First operand 583 states and 746 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:34:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:48,201 INFO L93 Difference]: Finished difference Result 1113 states and 1426 transitions. [2024-10-13 06:34:48,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:34:48,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-13 06:34:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:48,203 INFO L225 Difference]: With dead ends: 1113 [2024-10-13 06:34:48,204 INFO L226 Difference]: Without dead ends: 597 [2024-10-13 06:34:48,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:34:48,205 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:48,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 356 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:34:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-10-13 06:34:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 583. [2024-10-13 06:34:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 535 states have (on average 1.2523364485981308) internal successors, (670), 538 states have internal predecessors, (670), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:34:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 742 transitions. [2024-10-13 06:34:48,273 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 742 transitions. Word has length 59 [2024-10-13 06:34:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:48,274 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 742 transitions. [2024-10-13 06:34:48,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 06:34:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 742 transitions. [2024-10-13 06:34:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 06:34:48,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:48,275 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:48,283 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 (22)] Ended with exit code 0 [2024-10-13 06:34:48,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:48,476 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:48,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash -867593666, now seen corresponding path program 1 times [2024-10-13 06:34:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:48,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461754252] [2024-10-13 06:34:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:48,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:48,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:48,478 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:48,478 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 (23)] Waiting until timeout for monitored process [2024-10-13 06:34:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:48,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 06:34:48,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:48,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2024-10-13 06:34:51,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:51,776 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 150 treesize of output 65 [2024-10-13 06:34:51,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:51,838 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 150 treesize of output 65 [2024-10-13 06:34:51,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:51,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 98 [2024-10-13 06:34:51,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:51,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 216 treesize of output 148 [2024-10-13 06:34:52,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:52,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 220 treesize of output 154 [2024-10-13 06:34:52,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:52,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 410 treesize of output 152 [2024-10-13 06:34:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 06:34:52,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:34:52,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461754252] [2024-10-13 06:34:52,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461754252] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:34:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1897892794] [2024-10-13 06:34:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:52,916 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:34:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:34:52,917 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:34:52,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-10-13 06:34:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:53,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-13 06:34:53,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:53,896 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 8 treesize of output 4 [2024-10-13 06:34:57,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-13 06:35:03,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:35:03,962 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 118 treesize of output 61 [2024-10-13 06:35:04,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:35:04,055 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 118 treesize of output 61 [2024-10-13 06:35:04,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:35:04,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 88 [2024-10-13 06:35:04,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:35:04,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 192 treesize of output 128 [2024-10-13 06:35:04,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:35:04,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 69 treesize of output 75 [2024-10-13 06:35:04,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:35:04,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 211 treesize of output 87 [2024-10-13 06:35:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 06:35:04,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:35:04,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1897892794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:35:04,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:35:04,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-10-13 06:35:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396288506] [2024-10-13 06:35:04,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:35:04,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 06:35:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:35:04,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 06:35:04,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=667, Unknown=3, NotChecked=0, Total=812 [2024-10-13 06:35:04,958 INFO L87 Difference]: Start difference. First operand 583 states and 742 transitions. Second operand has 26 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)