./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.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 d2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:35:01,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:35:01,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:35:01,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:35:01,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:35:01,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:35:01,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:35:01,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:35:01,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:35:01,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:35:01,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:35:01,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:35:01,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:35:01,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:35:01,488 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:35:01,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:35:01,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:35:01,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:35:01,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:35:01,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:35:01,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:35:01,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:35:01,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:35:01,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:35:01,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:35:01,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:35:01,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:35:01,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:35:01,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:35:01,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:35:01,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:35:01,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:35:01,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:01,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:35:01,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:35:01,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:35:01,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:35:01,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:35:01,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:35:01,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:35:01,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:35:01,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:35:01,498 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 -> d2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0 [2024-11-19 00:35:01,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:35:01,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:35:01,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:35:01,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:35:01,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:35:01,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i [2024-11-19 00:35:03,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:35:03,290 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:35:03,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i [2024-11-19 00:35:03,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0025c0491/d6f2644579fa41caa31cc8e67d47ffb0/FLAG9da7f49b0 [2024-11-19 00:35:03,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0025c0491/d6f2644579fa41caa31cc8e67d47ffb0 [2024-11-19 00:35:03,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:35:03,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:35:03,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:03,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:35:03,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:35:03,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:03,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a305b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03, skipping insertion in model container [2024-11-19 00:35:03,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:03,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:35:03,815 WARN L250 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-a_file-39.i[916,929] [2024-11-19 00:35:03,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:03,907 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:35:03,916 WARN L250 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-a_file-39.i[916,929] [2024-11-19 00:35:03,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:03,997 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:35:03,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03 WrapperNode [2024-11-19 00:35:03,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:03,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:03,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:35:03,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:35:04,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,058 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 604 [2024-11-19 00:35:04,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:04,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:35:04,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:35:04,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:35:04,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,095 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2024-11-19 00:35:04,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:35:04,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:35:04,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:35:04,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:35:04,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (1/1) ... [2024-11-19 00:35:04,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:04,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:04,197 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-11-19 00:35:04,206 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-11-19 00:35:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:35:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:35:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:35:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:35:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:35:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:35:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:35:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:35:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:35:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:35:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:35:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:35:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:35:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:35:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:35:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:35:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:35:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:35:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:35:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:35:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:35:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:35:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:35:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:35:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:35:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:35:04,248 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:35:04,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:35:04,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:35:04,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:35:04,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:35:04,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:35:04,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:35:04,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:35:04,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:35:04,395 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:35:04,397 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:35:04,910 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-19 00:35:04,911 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:35:04,933 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:35:04,934 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:35:04,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:04 BoogieIcfgContainer [2024-11-19 00:35:04,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:35:04,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:35:04,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:35:04,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:35:04,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:35:03" (1/3) ... [2024-11-19 00:35:04,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41be41d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:04, skipping insertion in model container [2024-11-19 00:35:04,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:03" (2/3) ... [2024-11-19 00:35:04,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41be41d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:04, skipping insertion in model container [2024-11-19 00:35:04,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:04" (3/3) ... [2024-11-19 00:35:04,944 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-39.i [2024-11-19 00:35:04,959 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:35:04,959 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:35:05,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:35:05,014 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;@578a3111, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:35:05,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:35:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:35:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:35:05,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:05,028 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:05,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:05,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1938211499, now seen corresponding path program 1 times [2024-11-19 00:35:05,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:05,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767310130] [2024-11-19 00:35:05,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:05,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-19 00:35:05,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:05,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767310130] [2024-11-19 00:35:05,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767310130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:05,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922395095] [2024-11-19 00:35:05,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:05,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:05,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:05,292 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-11-19 00:35:05,293 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-11-19 00:35:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:05,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:35:05,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-19 00:35:05,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922395095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:05,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:35:05,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:35:05,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083408032] [2024-11-19 00:35:05,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:05,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:35:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:05,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:35:05,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:05,571 INFO L87 Difference]: Start difference. First operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:05,607 INFO L93 Difference]: Finished difference Result 233 states and 364 transitions. [2024-11-19 00:35:05,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:35:05,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-19 00:35:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:05,625 INFO L225 Difference]: With dead ends: 233 [2024-11-19 00:35:05,626 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 00:35:05,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-11-19 00:35:05,636 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:05,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 00:35:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-19 00:35:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:35:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-11-19 00:35:05,722 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 128 [2024-11-19 00:35:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:05,723 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-11-19 00:35:05,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-11-19 00:35:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:35:05,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:05,726 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:05,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:35:05,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:35:05,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:05,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:05,932 INFO L85 PathProgramCache]: Analyzing trace with hash -321601841, now seen corresponding path program 1 times [2024-11-19 00:35:05,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:05,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043960735] [2024-11-19 00:35:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:05,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:09,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:09,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043960735] [2024-11-19 00:35:09,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043960735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:09,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:09,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 00:35:09,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411732760] [2024-11-19 00:35:09,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:09,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:35:09,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:09,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:35:09,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:35:09,169 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:35:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:10,488 INFO L93 Difference]: Finished difference Result 390 states and 571 transitions. [2024-11-19 00:35:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:35:10,489 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2024-11-19 00:35:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:10,492 INFO L225 Difference]: With dead ends: 390 [2024-11-19 00:35:10,492 INFO L226 Difference]: Without dead ends: 277 [2024-11-19 00:35:10,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:35:10,494 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 298 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:10,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1900 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 00:35:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-19 00:35:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 271. [2024-11-19 00:35:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 239 states have (on average 1.4351464435146444) internal successors, (343), 241 states have internal predecessors, (343), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:35:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 399 transitions. [2024-11-19 00:35:10,520 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 399 transitions. Word has length 128 [2024-11-19 00:35:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:10,521 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 399 transitions. [2024-11-19 00:35:10,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:35:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 399 transitions. [2024-11-19 00:35:10,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:35:10,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:10,523 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:10,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:35:10,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:10,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash 358456529, now seen corresponding path program 1 times [2024-11-19 00:35:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488125965] [2024-11-19 00:35:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:11,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:11,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488125965] [2024-11-19 00:35:11,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488125965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:11,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:11,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:35:11,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237174848] [2024-11-19 00:35:11,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:11,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:35:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:11,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:35:11,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:35:11,248 INFO L87 Difference]: Start difference. First operand 271 states and 399 transitions. Second operand has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:35:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:11,693 INFO L93 Difference]: Finished difference Result 629 states and 924 transitions. [2024-11-19 00:35:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:35:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2024-11-19 00:35:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:11,699 INFO L225 Difference]: With dead ends: 629 [2024-11-19 00:35:11,699 INFO L226 Difference]: Without dead ends: 361 [2024-11-19 00:35:11,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:35:11,702 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 127 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:11,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 833 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:35:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-19 00:35:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 297. [2024-11-19 00:35:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 264 states have (on average 1.4318181818181819) internal successors, (378), 266 states have internal predecessors, (378), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:35:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 434 transitions. [2024-11-19 00:35:11,736 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 434 transitions. Word has length 128 [2024-11-19 00:35:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:11,736 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 434 transitions. [2024-11-19 00:35:11,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 00:35:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 434 transitions. [2024-11-19 00:35:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:35:11,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:11,738 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:11,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:35:11,739 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:11,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1909949743, now seen corresponding path program 1 times [2024-11-19 00:35:11,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:11,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822403764] [2024-11-19 00:35:11,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:12,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:12,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822403764] [2024-11-19 00:35:12,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822403764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:12,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:12,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:35:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357792031] [2024-11-19 00:35:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:12,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:35:12,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:12,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:35:12,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:35:12,260 INFO L87 Difference]: Start difference. First operand 297 states and 434 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:12,626 INFO L93 Difference]: Finished difference Result 599 states and 871 transitions. [2024-11-19 00:35:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:35:12,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-19 00:35:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:12,630 INFO L225 Difference]: With dead ends: 599 [2024-11-19 00:35:12,630 INFO L226 Difference]: Without dead ends: 305 [2024-11-19 00:35:12,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:35:12,631 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 124 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:12,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1084 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:35:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-19 00:35:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 239. [2024-11-19 00:35:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 211 states have (on average 1.4170616113744077) internal successors, (299), 212 states have internal predecessors, (299), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:35:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 345 transitions. [2024-11-19 00:35:12,651 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 345 transitions. Word has length 128 [2024-11-19 00:35:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:12,652 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 345 transitions. [2024-11-19 00:35:12,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 345 transitions. [2024-11-19 00:35:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:35:12,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:12,655 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:12,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:35:12,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:12,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:12,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1229891373, now seen corresponding path program 1 times [2024-11-19 00:35:12,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:12,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183402432] [2024-11-19 00:35:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:12,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:13,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:13,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183402432] [2024-11-19 00:35:13,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183402432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:13,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:13,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:35:13,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873975839] [2024-11-19 00:35:13,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:13,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:35:13,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:35:13,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:35:13,781 INFO L87 Difference]: Start difference. First operand 239 states and 345 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:14,804 INFO L93 Difference]: Finished difference Result 559 states and 809 transitions. [2024-11-19 00:35:14,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:35:14,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-19 00:35:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:14,807 INFO L225 Difference]: With dead ends: 559 [2024-11-19 00:35:14,809 INFO L226 Difference]: Without dead ends: 323 [2024-11-19 00:35:14,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:35:14,811 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 260 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:14,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1179 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:35:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-19 00:35:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 260. [2024-11-19 00:35:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 232 states have (on average 1.4224137931034482) internal successors, (330), 233 states have internal predecessors, (330), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:35:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2024-11-19 00:35:14,849 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 376 transitions. Word has length 128 [2024-11-19 00:35:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:14,850 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 376 transitions. [2024-11-19 00:35:14,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 376 transitions. [2024-11-19 00:35:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:35:14,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:14,852 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:14,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:35:14,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:14,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2071281815, now seen corresponding path program 1 times [2024-11-19 00:35:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:14,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330641636] [2024-11-19 00:35:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:16,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:16,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330641636] [2024-11-19 00:35:16,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330641636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:16,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:16,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:35:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624246069] [2024-11-19 00:35:16,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:16,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:35:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:35:16,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:35:16,101 INFO L87 Difference]: Start difference. First operand 260 states and 376 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:16,660 INFO L93 Difference]: Finished difference Result 591 states and 852 transitions. [2024-11-19 00:35:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:35:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2024-11-19 00:35:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:16,662 INFO L225 Difference]: With dead ends: 591 [2024-11-19 00:35:16,662 INFO L226 Difference]: Without dead ends: 334 [2024-11-19 00:35:16,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:35:16,663 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 129 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:16,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1393 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:35:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-19 00:35:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 235. [2024-11-19 00:35:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.4154589371980677) internal successors, (293), 208 states have internal predecessors, (293), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:35:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 339 transitions. [2024-11-19 00:35:16,677 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 339 transitions. Word has length 129 [2024-11-19 00:35:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:16,678 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 339 transitions. [2024-11-19 00:35:16,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 339 transitions. [2024-11-19 00:35:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 00:35:16,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:16,679 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:16,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:35:16,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:16,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash -541234758, now seen corresponding path program 1 times [2024-11-19 00:35:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:16,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564224719] [2024-11-19 00:35:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:16,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:16,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:16,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564224719] [2024-11-19 00:35:16,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564224719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:16,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:16,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:35:16,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284716341] [2024-11-19 00:35:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:16,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:35:16,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:35:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:16,871 INFO L87 Difference]: Start difference. First operand 235 states and 339 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:17,083 INFO L93 Difference]: Finished difference Result 633 states and 910 transitions. [2024-11-19 00:35:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:35:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-11-19 00:35:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:17,087 INFO L225 Difference]: With dead ends: 633 [2024-11-19 00:35:17,087 INFO L226 Difference]: Without dead ends: 401 [2024-11-19 00:35:17,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:35:17,088 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 118 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:17,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 784 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:35:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-19 00:35:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 258. [2024-11-19 00:35:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.4217391304347826) internal successors, (327), 231 states have internal predecessors, (327), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:35:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 373 transitions. [2024-11-19 00:35:17,105 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 373 transitions. Word has length 130 [2024-11-19 00:35:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:17,105 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 373 transitions. [2024-11-19 00:35:17,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 373 transitions. [2024-11-19 00:35:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:35:17,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:17,107 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:17,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:35:17,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:17,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:17,108 INFO L85 PathProgramCache]: Analyzing trace with hash 420940497, now seen corresponding path program 1 times [2024-11-19 00:35:17,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:17,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185540442] [2024-11-19 00:35:17,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:17,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:18,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:18,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185540442] [2024-11-19 00:35:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185540442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:18,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:18,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:35:18,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558531736] [2024-11-19 00:35:18,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:18,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:35:18,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:18,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:35:18,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:35:18,095 INFO L87 Difference]: Start difference. First operand 258 states and 373 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:18,680 INFO L93 Difference]: Finished difference Result 612 states and 882 transitions. [2024-11-19 00:35:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:35:18,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-19 00:35:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:18,682 INFO L225 Difference]: With dead ends: 612 [2024-11-19 00:35:18,682 INFO L226 Difference]: Without dead ends: 357 [2024-11-19 00:35:18,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:35:18,683 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 120 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:18,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1351 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:35:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-19 00:35:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 258. [2024-11-19 00:35:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.4173913043478261) internal successors, (326), 231 states have internal predecessors, (326), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:35:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 372 transitions. [2024-11-19 00:35:18,699 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 372 transitions. Word has length 131 [2024-11-19 00:35:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:18,699 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 372 transitions. [2024-11-19 00:35:18,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 372 transitions. [2024-11-19 00:35:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:35:18,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:18,701 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:18,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:35:18,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:18,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash -842538372, now seen corresponding path program 1 times [2024-11-19 00:35:18,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:18,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746805213] [2024-11-19 00:35:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:18,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:18,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746805213] [2024-11-19 00:35:18,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746805213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:18,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:18,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:35:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307487974] [2024-11-19 00:35:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:18,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:35:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:18,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:35:18,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:35:18,807 INFO L87 Difference]: Start difference. First operand 258 states and 372 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:19,080 INFO L93 Difference]: Finished difference Result 595 states and 853 transitions. [2024-11-19 00:35:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:35:19,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-19 00:35:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:19,083 INFO L225 Difference]: With dead ends: 595 [2024-11-19 00:35:19,083 INFO L226 Difference]: Without dead ends: 340 [2024-11-19 00:35:19,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:19,084 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 132 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:19,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 521 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:35:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-19 00:35:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2024-11-19 00:35:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 295 states have (on average 1.3966101694915254) internal successors, (412), 297 states have internal predecessors, (412), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 00:35:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 480 transitions. [2024-11-19 00:35:19,106 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 480 transitions. Word has length 133 [2024-11-19 00:35:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:19,106 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 480 transitions. [2024-11-19 00:35:19,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 480 transitions. [2024-11-19 00:35:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:35:19,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:19,108 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:19,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:35:19,108 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash -665800542, now seen corresponding path program 1 times [2024-11-19 00:35:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:19,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846747498] [2024-11-19 00:35:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:19,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846747498] [2024-11-19 00:35:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846747498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:19,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:19,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:35:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006793825] [2024-11-19 00:35:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:19,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:35:19,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:19,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:35:19,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:35:19,221 INFO L87 Difference]: Start difference. First operand 337 states and 480 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:19,456 INFO L93 Difference]: Finished difference Result 671 states and 952 transitions. [2024-11-19 00:35:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:35:19,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-19 00:35:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:19,458 INFO L225 Difference]: With dead ends: 671 [2024-11-19 00:35:19,458 INFO L226 Difference]: Without dead ends: 337 [2024-11-19 00:35:19,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:19,459 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 121 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:19,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 563 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:35:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-19 00:35:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 334. [2024-11-19 00:35:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 291 states have (on average 1.388316151202749) internal successors, (404), 293 states have internal predecessors, (404), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 00:35:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 472 transitions. [2024-11-19 00:35:19,479 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 472 transitions. Word has length 134 [2024-11-19 00:35:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:19,479 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 472 transitions. [2024-11-19 00:35:19,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 472 transitions. [2024-11-19 00:35:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:35:19,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:19,481 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:19,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:35:19,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:19,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:19,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1251066523, now seen corresponding path program 1 times [2024-11-19 00:35:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520282741] [2024-11-19 00:35:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520282741] [2024-11-19 00:35:19,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520282741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:19,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:19,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:35:19,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035960589] [2024-11-19 00:35:19,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:19,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:35:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:19,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:35:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:35:19,643 INFO L87 Difference]: Start difference. First operand 334 states and 472 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:19,864 INFO L93 Difference]: Finished difference Result 585 states and 812 transitions. [2024-11-19 00:35:19,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:35:19,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-19 00:35:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:19,867 INFO L225 Difference]: With dead ends: 585 [2024-11-19 00:35:19,867 INFO L226 Difference]: Without dead ends: 583 [2024-11-19 00:35:19,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:35:19,868 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 102 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:19,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1069 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:35:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-19 00:35:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 392. [2024-11-19 00:35:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 349 states have (on average 1.3581661891117478) internal successors, (474), 351 states have internal predecessors, (474), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 00:35:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 542 transitions. [2024-11-19 00:35:19,892 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 542 transitions. Word has length 134 [2024-11-19 00:35:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:19,892 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 542 transitions. [2024-11-19 00:35:19,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 542 transitions. [2024-11-19 00:35:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:35:19,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:19,893 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:19,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:35:19,894 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:19,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1807259723, now seen corresponding path program 1 times [2024-11-19 00:35:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116412387] [2024-11-19 00:35:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:19,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:20,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116412387] [2024-11-19 00:35:20,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116412387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:20,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:20,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:35:20,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779616257] [2024-11-19 00:35:20,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:20,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:35:20,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:20,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:35:20,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:35:20,448 INFO L87 Difference]: Start difference. First operand 392 states and 542 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:21,127 INFO L93 Difference]: Finished difference Result 909 states and 1263 transitions. [2024-11-19 00:35:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:35:21,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-19 00:35:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:21,130 INFO L225 Difference]: With dead ends: 909 [2024-11-19 00:35:21,130 INFO L226 Difference]: Without dead ends: 520 [2024-11-19 00:35:21,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:35:21,131 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 324 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:21,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1102 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:35:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-19 00:35:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 433. [2024-11-19 00:35:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 390 states have (on average 1.3692307692307693) internal successors, (534), 392 states have internal predecessors, (534), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 00:35:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 602 transitions. [2024-11-19 00:35:21,155 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 602 transitions. Word has length 135 [2024-11-19 00:35:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:21,159 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 602 transitions. [2024-11-19 00:35:21,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 602 transitions. [2024-11-19 00:35:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:35:21,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:21,160 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:21,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:35:21,160 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:21,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1348992656, now seen corresponding path program 1 times [2024-11-19 00:35:21,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:21,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597798915] [2024-11-19 00:35:21,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:21,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597798915] [2024-11-19 00:35:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597798915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:21,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:21,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:35:21,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185424537] [2024-11-19 00:35:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:21,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:35:21,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:21,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:35:21,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:35:21,825 INFO L87 Difference]: Start difference. First operand 433 states and 602 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:22,602 INFO L93 Difference]: Finished difference Result 936 states and 1297 transitions. [2024-11-19 00:35:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:35:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-11-19 00:35:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:22,604 INFO L225 Difference]: With dead ends: 936 [2024-11-19 00:35:22,604 INFO L226 Difference]: Without dead ends: 506 [2024-11-19 00:35:22,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:35:22,605 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 261 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:22,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1263 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:35:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-19 00:35:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 446. [2024-11-19 00:35:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 403 states have (on average 1.3598014888337469) internal successors, (548), 405 states have internal predecessors, (548), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 00:35:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 616 transitions. [2024-11-19 00:35:22,628 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 616 transitions. Word has length 136 [2024-11-19 00:35:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:22,629 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 616 transitions. [2024-11-19 00:35:22,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 616 transitions. [2024-11-19 00:35:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:35:22,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:22,630 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:22,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:35:22,630 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:22,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:22,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1302307900, now seen corresponding path program 1 times [2024-11-19 00:35:22,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:22,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458938435] [2024-11-19 00:35:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:22,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458938435] [2024-11-19 00:35:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458938435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:35:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143266656] [2024-11-19 00:35:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:22,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:35:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:22,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:35:22,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:35:22,723 INFO L87 Difference]: Start difference. First operand 446 states and 616 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:22,937 INFO L93 Difference]: Finished difference Result 1161 states and 1607 transitions. [2024-11-19 00:35:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:35:22,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-19 00:35:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:22,943 INFO L225 Difference]: With dead ends: 1161 [2024-11-19 00:35:22,943 INFO L226 Difference]: Without dead ends: 718 [2024-11-19 00:35:22,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:22,945 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 112 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:22,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 434 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:35:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-19 00:35:22,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 504. [2024-11-19 00:35:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 461 states have (on average 1.3622559652928417) internal successors, (628), 463 states have internal predecessors, (628), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 00:35:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 696 transitions. [2024-11-19 00:35:22,996 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 696 transitions. Word has length 136 [2024-11-19 00:35:22,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:22,997 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 696 transitions. [2024-11-19 00:35:22,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 696 transitions. [2024-11-19 00:35:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:35:22,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:22,999 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:22,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:35:22,999 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1343544007, now seen corresponding path program 1 times [2024-11-19 00:35:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198581187] [2024-11-19 00:35:22,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:23,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:23,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198581187] [2024-11-19 00:35:23,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198581187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:23,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:23,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:35:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593489229] [2024-11-19 00:35:23,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:23,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:35:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:35:23,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:35:23,191 INFO L87 Difference]: Start difference. First operand 504 states and 696 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:23,543 INFO L93 Difference]: Finished difference Result 1137 states and 1567 transitions. [2024-11-19 00:35:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:35:23,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-19 00:35:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:23,548 INFO L225 Difference]: With dead ends: 1137 [2024-11-19 00:35:23,548 INFO L226 Difference]: Without dead ends: 636 [2024-11-19 00:35:23,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:35:23,552 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 111 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:23,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 739 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:35:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-19 00:35:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 340. [2024-11-19 00:35:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 319 states have (on average 1.3605015673981191) internal successors, (434), 319 states have internal predecessors, (434), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:35:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 466 transitions. [2024-11-19 00:35:23,570 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 466 transitions. Word has length 136 [2024-11-19 00:35:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:23,571 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 466 transitions. [2024-11-19 00:35:23,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 466 transitions. [2024-11-19 00:35:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:35:23,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:23,575 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:23,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:35:23,575 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:23,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash 55100714, now seen corresponding path program 1 times [2024-11-19 00:35:23,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897864691] [2024-11-19 00:35:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:23,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:35:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897864691] [2024-11-19 00:35:23,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897864691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:23,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:23,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:35:23,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575659350] [2024-11-19 00:35:23,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:23,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:35:23,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:35:23,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:35:23,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:35:23,790 INFO L87 Difference]: Start difference. First operand 340 states and 466 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:24,044 INFO L93 Difference]: Finished difference Result 462 states and 617 transitions. [2024-11-19 00:35:24,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:35:24,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-19 00:35:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:24,047 INFO L225 Difference]: With dead ends: 462 [2024-11-19 00:35:24,047 INFO L226 Difference]: Without dead ends: 460 [2024-11-19 00:35:24,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:35:24,048 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 92 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:24,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1339 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:35:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-19 00:35:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 398. [2024-11-19 00:35:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 377 states have (on average 1.3262599469496021) internal successors, (500), 377 states have internal predecessors, (500), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:35:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 532 transitions. [2024-11-19 00:35:24,069 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 532 transitions. Word has length 137 [2024-11-19 00:35:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:24,069 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 532 transitions. [2024-11-19 00:35:24,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 532 transitions. [2024-11-19 00:35:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:35:24,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:24,071 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:24,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:35:24,072 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:24,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:24,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1502374088, now seen corresponding path program 1 times [2024-11-19 00:35:24,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:35:24,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109396506] [2024-11-19 00:35:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:24,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:35:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:35:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510116905] [2024-11-19 00:35:24,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:24,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:35:24,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:24,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:35:24,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:35:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:35:24,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:35:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:35:24,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:35:24,633 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:35:24,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:35:24,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:35:24,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 00:35:24,843 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:35:24,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:35:24,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:35:24 BoogieIcfgContainer [2024-11-19 00:35:24,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:35:24,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:35:24,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:35:24,930 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:35:24,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:04" (3/4) ... [2024-11-19 00:35:24,933 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:35:24,934 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:35:24,934 INFO L158 Benchmark]: Toolchain (without parser) took 21280.96ms. Allocated memory was 165.7MB in the beginning and 799.0MB in the end (delta: 633.3MB). Free memory was 93.7MB in the beginning and 305.7MB in the end (delta: -212.0MB). Peak memory consumption was 421.6MB. Max. memory is 16.1GB. [2024-11-19 00:35:24,934 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 165.7MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:35:24,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.32ms. Allocated memory is still 165.7MB. Free memory was 93.7MB in the beginning and 76.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:35:24,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.89ms. Allocated memory is still 165.7MB. Free memory was 76.9MB in the beginning and 72.5MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:35:24,935 INFO L158 Benchmark]: Boogie Preprocessor took 97.96ms. Allocated memory is still 165.7MB. Free memory was 72.5MB in the beginning and 67.1MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:35:24,935 INFO L158 Benchmark]: RCFGBuilder took 776.21ms. Allocated memory was 165.7MB in the beginning and 251.7MB in the end (delta: 86.0MB). Free memory was 67.1MB in the beginning and 193.5MB in the end (delta: -126.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-19 00:35:24,936 INFO L158 Benchmark]: TraceAbstraction took 19991.87ms. Allocated memory was 251.7MB in the beginning and 799.0MB in the end (delta: 547.4MB). Free memory was 193.5MB in the beginning and 305.7MB in the end (delta: -112.3MB). Peak memory consumption was 435.1MB. Max. memory is 16.1GB. [2024-11-19 00:35:24,936 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 799.0MB. Free memory is still 305.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:35:24,937 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.40ms. Allocated memory is still 165.7MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.32ms. Allocated memory is still 165.7MB. Free memory was 93.7MB in the beginning and 76.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.89ms. Allocated memory is still 165.7MB. Free memory was 76.9MB in the beginning and 72.5MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.96ms. Allocated memory is still 165.7MB. Free memory was 72.5MB in the beginning and 67.1MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 776.21ms. Allocated memory was 165.7MB in the beginning and 251.7MB in the end (delta: 86.0MB). Free memory was 67.1MB in the beginning and 193.5MB in the end (delta: -126.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19991.87ms. Allocated memory was 251.7MB in the beginning and 799.0MB in the end (delta: 547.4MB). Free memory was 193.5MB in the beginning and 305.7MB in the end (delta: -112.3MB). Peak memory consumption was 435.1MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 799.0MB. Free memory is still 305.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of shiftLeft at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 64 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 64 }; VAL [float_Array_0={4:0}, isInitial=0, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] float_Array_0[0] = __VERIFIER_nondet_float() [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L62] float_Array_0[1] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] float_Array_0[2] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L67] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= 1073741823) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(signed_long_int_Array_0[0] >= 1073741823) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L70] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L73] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L76] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[2] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L79] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L97] RET updateVariables() [L98] CALL step() [L37] EXPR signed_short_int_Array_0[3] [L37] EXPR signed_short_int_Array_0[2] [L37] EXPR signed_short_int_Array_0[1] [L37] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L37] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) [L37] EXPR signed_short_int_Array_0[1] [L37] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L37] signed_short_int_Array_0[4] = ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))) [L38] EXPR signed_short_int_Array_0[3] [L38] EXPR signed_short_int_Array_0[4] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] COND FALSE !(signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) [L45] EXPR signed_short_int_Array_0[1] [L45] signed_long_int_Array_0[2] = signed_short_int_Array_0[1] [L47] EXPR signed_long_int_Array_0[2] [L47] EXPR signed_short_int_Array_0[1] [L47] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR signed_short_int_Array_0[1] << signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] signed long int stepLocal_1 = signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3]); [L48] EXPR signed_short_int_Array_0[3] [L48] EXPR signed_long_int_Array_0[0] [L48] EXPR signed_short_int_Array_0[0] [L48] signed long int stepLocal_0 = signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]); [L49] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L49] COND TRUE stepLocal_1 != signed_short_int_Array_0[0] [L50] EXPR signed_short_int_Array_0[2] [L50] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L50] COND FALSE !((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < stepLocal_0) [L53] EXPR signed_short_int_Array_0[1] [L53] signed_long_int_Array_0[1] = signed_short_int_Array_0[1] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR signed_short_int_Array_0[4] [L89] EXPR signed_short_int_Array_0[3] [L89] EXPR signed_short_int_Array_0[2] [L89] EXPR signed_short_int_Array_0[1] [L89] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) [L89] EXPR signed_short_int_Array_0[1] [L89] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1]))) [L89] EXPR signed_short_int_Array_0[3] [L89] EXPR signed_short_int_Array_0[4] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) [L89] EXPR signed_long_int_Array_0[2] [L89] EXPR signed_short_int_Array_0[1] [L89] EXPR (signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) [L89] EXPR signed_long_int_Array_0[2] [L89] EXPR signed_short_int_Array_0[1] [L89] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR signed_short_int_Array_0[1] << signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3])) [L89] EXPR signed_long_int_Array_0[1] [L89] EXPR signed_short_int_Array_0[3] [L89] EXPR ((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3])) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89-L90] return ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 17, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2438 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2431 mSDsluCounter, 15724 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12752 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8629 IncrementalHoareTripleChecker+Invalid, 8749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 2972 mSDtfsCounter, 8629 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=504occurred in iteration=14, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2513 NumberOfCodeBlocks, 2513 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2222 ConstructedInterpolants, 0 QuantifiedInterpolants, 8215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 8130/8160 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-11-19 00:35:24,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.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 d2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:35:27,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:35:27,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:35:27,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:35:27,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:35:27,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:35:27,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:35:27,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:35:27,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:35:27,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:35:27,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:35:27,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:35:27,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:35:27,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:35:27,474 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:35:27,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:35:27,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:35:27,475 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:35:27,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:35:27,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:35:27,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:35:27,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:35:27,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:35:27,479 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:35:27,479 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:35:27,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:35:27,479 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:35:27,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:35:27,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:35:27,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:35:27,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:35:27,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:35:27,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:35:27,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:35:27,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:27,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:35:27,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:35:27,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:35:27,492 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:35:27,492 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:35:27,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:35:27,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:35:27,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:35:27,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:35:27,493 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 -> d2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0 [2024-11-19 00:35:27,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:35:27,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:35:27,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:35:27,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:35:27,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:35:27,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i [2024-11-19 00:35:29,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:35:29,614 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:35:29,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i [2024-11-19 00:35:29,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d922566/ee36e49037d04958a089566c11079cf2/FLAG2f2ba8633 [2024-11-19 00:35:29,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d922566/ee36e49037d04958a089566c11079cf2 [2024-11-19 00:35:30,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:35:30,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:35:30,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:30,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:35:30,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:35:30,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:29" (1/1) ... [2024-11-19 00:35:30,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b67ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30, skipping insertion in model container [2024-11-19 00:35:30,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:35:29" (1/1) ... [2024-11-19 00:35:30,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:35:30,217 WARN L250 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-a_file-39.i[916,929] [2024-11-19 00:35:30,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:30,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:35:30,297 WARN L250 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-a_file-39.i[916,929] [2024-11-19 00:35:30,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:35:30,369 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:35:30,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30 WrapperNode [2024-11-19 00:35:30,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:35:30,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:30,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:35:30,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:35:30,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,445 INFO L138 Inliner]: procedures = 36, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 586 [2024-11-19 00:35:30,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:35:30,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:35:30,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:35:30,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:35:30,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,502 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2024-11-19 00:35:30,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:35:30,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:35:30,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:35:30,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:35:30,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (1/1) ... [2024-11-19 00:35:30,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:35:30,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:35:30,598 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-11-19 00:35:30,604 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-11-19 00:35:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:35:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:35:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:35:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:35:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:35:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:35:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:35:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:35:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:35:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:35:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:35:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:35:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:35:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:35:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:35:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:35:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:35:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:35:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:35:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:35:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:35:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:35:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:35:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:35:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:35:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:35:30,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:35:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:35:30,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:35:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:35:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:35:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:35:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:35:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:35:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:35:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:35:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:35:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:35:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:35:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:35:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:35:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:35:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:35:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:35:30,788 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:35:30,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:35:31,681 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-19 00:35:31,681 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:35:31,703 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:35:31,703 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:35:31,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:31 BoogieIcfgContainer [2024-11-19 00:35:31,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:35:31,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:35:31,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:35:31,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:35:31,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:35:29" (1/3) ... [2024-11-19 00:35:31,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674e9993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:31, skipping insertion in model container [2024-11-19 00:35:31,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:35:30" (2/3) ... [2024-11-19 00:35:31,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674e9993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:35:31, skipping insertion in model container [2024-11-19 00:35:31,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:35:31" (3/3) ... [2024-11-19 00:35:31,712 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-39.i [2024-11-19 00:35:31,725 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:35:31,725 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:35:31,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:35:31,792 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;@14e158c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:35:31,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:35:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:35:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:35:31,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:31,811 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:31,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:31,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:31,817 INFO L85 PathProgramCache]: Analyzing trace with hash -607755742, now seen corresponding path program 1 times [2024-11-19 00:35:31,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:31,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838048875] [2024-11-19 00:35:31,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:31,829 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-11-19 00:35:31,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:31,832 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-11-19 00:35:31,858 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-11-19 00:35:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:32,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:35:32,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-19 00:35:32,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:35:32,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:32,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838048875] [2024-11-19 00:35:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838048875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:35:32,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:35:32,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:35:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097645236] [2024-11-19 00:35:32,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:32,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:35:32,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:32,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:35:32,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:35:32,184 INFO L87 Difference]: Start difference. First operand has 114 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:32,206 INFO L93 Difference]: Finished difference Result 221 states and 348 transitions. [2024-11-19 00:35:32,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:35:32,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-11-19 00:35:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:32,213 INFO L225 Difference]: With dead ends: 221 [2024-11-19 00:35:32,213 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 00:35:32,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-11-19 00:35:32,218 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:32,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:35:32,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 00:35:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 00:35:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:35:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2024-11-19 00:35:32,249 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 126 [2024-11-19 00:35:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:32,249 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2024-11-19 00:35:32,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:35:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2024-11-19 00:35:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:35:32,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:32,252 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:32,260 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-11-19 00:35:32,453 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-11-19 00:35:32,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:32,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:32,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1007872186, now seen corresponding path program 1 times [2024-11-19 00:35:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37563583] [2024-11-19 00:35:32,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:32,456 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-11-19 00:35:32,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:32,458 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-11-19 00:35:32,459 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-11-19 00:35:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:32,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 00:35:32,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:32,979 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 12 treesize of output 8 [2024-11-19 00:35:33,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2024-11-19 00:35:33,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:33,999 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 60 treesize of output 35 [2024-11-19 00:35:34,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 35 [2024-11-19 00:35:35,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:35,937 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 88 treesize of output 56 [2024-11-19 00:35:35,984 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 21 treesize of output 17 [2024-11-19 00:35:36,148 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 47 treesize of output 35 [2024-11-19 00:35:36,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:36,651 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 91 treesize of output 39 [2024-11-19 00:35:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 344 proven. 78 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 00:35:36,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:37,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:37,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37563583] [2024-11-19 00:35:37,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37563583] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:37,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:35:37,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [34] total 40 [2024-11-19 00:35:37,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447387753] [2024-11-19 00:35:37,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:37,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:35:37,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:37,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:35:37,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1280, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 00:35:37,384 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:38,773 INFO L93 Difference]: Finished difference Result 442 states and 651 transitions. [2024-11-19 00:35:38,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:35:38,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-19 00:35:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:38,778 INFO L225 Difference]: With dead ends: 442 [2024-11-19 00:35:38,778 INFO L226 Difference]: Without dead ends: 335 [2024-11-19 00:35:38,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=312, Invalid=1494, Unknown=0, NotChecked=0, Total=1806 [2024-11-19 00:35:38,785 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 958 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:38,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 576 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 00:35:38,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-19 00:35:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 194. [2024-11-19 00:35:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.4470588235294117) internal successors, (246), 171 states have internal predecessors, (246), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:35:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2024-11-19 00:35:38,812 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 126 [2024-11-19 00:35:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:38,813 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2024-11-19 00:35:38,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2024-11-19 00:35:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:35:38,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:38,815 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:38,823 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-11-19 00:35:39,019 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-11-19 00:35:39,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:39,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1687930556, now seen corresponding path program 1 times [2024-11-19 00:35:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:39,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735167063] [2024-11-19 00:35:39,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:39,024 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-11-19 00:35:39,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:39,027 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-11-19 00:35:39,028 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-11-19 00:35:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:39,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-19 00:35:39,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:39,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:35:39,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-19 00:35:39,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2024-11-19 00:35:40,608 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 92 treesize of output 60 [2024-11-19 00:35:42,716 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 150 treesize of output 106 [2024-11-19 00:35:43,051 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 21 treesize of output 17 [2024-11-19 00:35:43,340 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 47 treesize of output 35 [2024-11-19 00:35:44,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:44,438 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 239 treesize of output 103 [2024-11-19 00:35:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 351 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-19 00:35:44,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:47,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:47,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735167063] [2024-11-19 00:35:47,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735167063] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:47,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:35:47,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [44] total 52 [2024-11-19 00:35:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62844008] [2024-11-19 00:35:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:47,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:35:47,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:35:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 00:35:47,176 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:52,637 INFO L93 Difference]: Finished difference Result 550 states and 815 transitions. [2024-11-19 00:35:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:35:52,639 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-19 00:35:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:52,642 INFO L225 Difference]: With dead ends: 550 [2024-11-19 00:35:52,642 INFO L226 Difference]: Without dead ends: 359 [2024-11-19 00:35:52,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=447, Invalid=2975, Unknown=0, NotChecked=0, Total=3422 [2024-11-19 00:35:52,645 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 434 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:52,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1357 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 00:35:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-19 00:35:52,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 196. [2024-11-19 00:35:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 172 states have (on average 1.441860465116279) internal successors, (248), 173 states have internal predecessors, (248), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:35:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2024-11-19 00:35:52,672 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 126 [2024-11-19 00:35:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:52,672 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2024-11-19 00:35:52,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2024-11-19 00:35:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:35:52,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:52,674 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:52,683 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-11-19 00:35:52,875 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-11-19 00:35:52,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:52,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2007231432, now seen corresponding path program 1 times [2024-11-19 00:35:52,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:52,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099938442] [2024-11-19 00:35:52,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:52,877 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-11-19 00:35:52,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:52,880 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-11-19 00:35:52,881 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-11-19 00:35:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:35:53,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 00:35:53,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:35:53,253 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 12 treesize of output 8 [2024-11-19 00:35:53,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 46 treesize of output 22 [2024-11-19 00:35:53,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2024-11-19 00:35:54,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2024-11-19 00:35:55,839 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 94 treesize of output 71 [2024-11-19 00:35:56,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:35:56,628 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 122 treesize of output 56 [2024-11-19 00:35:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 358 proven. 66 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-19 00:35:56,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:35:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:35:58,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:35:58,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099938442] [2024-11-19 00:35:58,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099938442] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:35:58,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:35:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [36] total 42 [2024-11-19 00:35:58,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653582571] [2024-11-19 00:35:58,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:35:58,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:35:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:35:58,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:35:58,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1435, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 00:35:58,053 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:35:59,529 INFO L93 Difference]: Finished difference Result 469 states and 695 transitions. [2024-11-19 00:35:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:35:59,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-19 00:35:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:35:59,532 INFO L225 Difference]: With dead ends: 469 [2024-11-19 00:35:59,535 INFO L226 Difference]: Without dead ends: 276 [2024-11-19 00:35:59,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 00:35:59,537 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 222 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:35:59,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1108 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 00:35:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-19 00:35:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 212. [2024-11-19 00:35:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 188 states have (on average 1.4574468085106382) internal successors, (274), 189 states have internal predecessors, (274), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 00:35:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 316 transitions. [2024-11-19 00:35:59,550 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 316 transitions. Word has length 126 [2024-11-19 00:35:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:35:59,551 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 316 transitions. [2024-11-19 00:35:59,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:35:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 316 transitions. [2024-11-19 00:35:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:35:59,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:35:59,552 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:35:59,563 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 (5)] Ended with exit code 0 [2024-11-19 00:35:59,756 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-11-19 00:35:59,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:35:59,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:35:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1327173062, now seen corresponding path program 1 times [2024-11-19 00:35:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:35:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701746381] [2024-11-19 00:35:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:35:59,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:35:59,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:35:59,762 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-11-19 00:35:59,774 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-11-19 00:36:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:00,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 00:36:00,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:00,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:00,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-19 00:36:00,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:00,606 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 65 treesize of output 51 [2024-11-19 00:36:00,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:00,841 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 80 treesize of output 54 [2024-11-19 00:36:01,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:01,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 52 [2024-11-19 00:36:01,530 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 21 treesize of output 17 [2024-11-19 00:36:01,650 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 47 treesize of output 35 [2024-11-19 00:36:01,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:01,961 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 114 treesize of output 50 [2024-11-19 00:36:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 267 proven. 84 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-11-19 00:36:02,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:36:02,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:02,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701746381] [2024-11-19 00:36:02,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701746381] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:02,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:02,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [26] total 32 [2024-11-19 00:36:02,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177958573] [2024-11-19 00:36:02,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:02,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:36:02,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:02,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:36:02,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2024-11-19 00:36:02,627 INFO L87 Difference]: Start difference. First operand 212 states and 316 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:36:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:04,355 INFO L93 Difference]: Finished difference Result 556 states and 816 transitions. [2024-11-19 00:36:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:36:04,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-19 00:36:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:04,358 INFO L225 Difference]: With dead ends: 556 [2024-11-19 00:36:04,358 INFO L226 Difference]: Without dead ends: 347 [2024-11-19 00:36:04,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 00:36:04,359 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 417 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:04,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1088 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 00:36:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-19 00:36:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 140. [2024-11-19 00:36:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 121 states have (on average 1.4132231404958677) internal successors, (171), 121 states have internal predecessors, (171), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:36:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2024-11-19 00:36:04,366 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 126 [2024-11-19 00:36:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:04,367 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2024-11-19 00:36:04,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:36:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2024-11-19 00:36:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 00:36:04,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:04,368 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:36:04,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 00:36:04,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:04,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:04,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash -568707458, now seen corresponding path program 1 times [2024-11-19 00:36:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:04,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267698801] [2024-11-19 00:36:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:04,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:04,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:04,573 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-11-19 00:36:04,574 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-11-19 00:36:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:04,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 00:36:04,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:04,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:05,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-19 00:36:05,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:05,366 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 55 treesize of output 47 [2024-11-19 00:36:05,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:05,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 60 [2024-11-19 00:36:06,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:06,328 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 77 treesize of output 60 [2024-11-19 00:36:06,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:06,412 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 76 treesize of output 34 [2024-11-19 00:36:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 307 proven. 84 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-19 00:36:06,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:36:06,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:06,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267698801] [2024-11-19 00:36:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267698801] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:06,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 26 [2024-11-19 00:36:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794981570] [2024-11-19 00:36:06,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:06,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:36:06,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:06,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:36:06,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2024-11-19 00:36:06,919 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:36:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:07,340 INFO L93 Difference]: Finished difference Result 360 states and 525 transitions. [2024-11-19 00:36:07,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:36:07,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-11-19 00:36:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:07,347 INFO L225 Difference]: With dead ends: 360 [2024-11-19 00:36:07,348 INFO L226 Difference]: Without dead ends: 223 [2024-11-19 00:36:07,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2024-11-19 00:36:07,349 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 118 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:07,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 425 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:36:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-19 00:36:07,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 159. [2024-11-19 00:36:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.4357142857142857) internal successors, (201), 140 states have internal predecessors, (201), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:36:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 233 transitions. [2024-11-19 00:36:07,364 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 233 transitions. Word has length 127 [2024-11-19 00:36:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:07,364 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 233 transitions. [2024-11-19 00:36:07,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:36:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 233 transitions. [2024-11-19 00:36:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 00:36:07,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:07,367 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:36:07,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 00:36:07,571 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-11-19 00:36:07,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:07,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1248765828, now seen corresponding path program 1 times [2024-11-19 00:36:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:07,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418278698] [2024-11-19 00:36:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:07,574 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-11-19 00:36:07,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:07,575 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-11-19 00:36:07,577 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-11-19 00:36:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:07,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 00:36:08,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:08,009 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-11-19 00:36:08,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-11-19 00:36:08,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2024-11-19 00:36:10,570 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 120 treesize of output 83 [2024-11-19 00:36:11,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:11,363 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 145 treesize of output 67 [2024-11-19 00:36:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 330 proven. 54 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-19 00:36:11,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:36:13,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:13,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418278698] [2024-11-19 00:36:13,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418278698] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:13,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:13,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [36] total 42 [2024-11-19 00:36:13,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824679209] [2024-11-19 00:36:13,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:13,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:36:13,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:36:13,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1435, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 00:36:13,349 INFO L87 Difference]: Start difference. First operand 159 states and 233 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:36:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:15,208 INFO L93 Difference]: Finished difference Result 401 states and 585 transitions. [2024-11-19 00:36:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:36:15,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-11-19 00:36:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:15,210 INFO L225 Difference]: With dead ends: 401 [2024-11-19 00:36:15,211 INFO L226 Difference]: Without dead ends: 245 [2024-11-19 00:36:15,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 00:36:15,212 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 117 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:15,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1216 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 00:36:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-19 00:36:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 238. [2024-11-19 00:36:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 210 states have (on average 1.438095238095238) internal successors, (302), 211 states have internal predecessors, (302), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:36:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 348 transitions. [2024-11-19 00:36:15,220 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 348 transitions. Word has length 127 [2024-11-19 00:36:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:15,220 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 348 transitions. [2024-11-19 00:36:15,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:36:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 348 transitions. [2024-11-19 00:36:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 00:36:15,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:15,222 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:36:15,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 00:36:15,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:15,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:15,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2025133114, now seen corresponding path program 1 times [2024-11-19 00:36:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:15,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259457099] [2024-11-19 00:36:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:15,424 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-11-19 00:36:15,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:15,425 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:36:15,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 00:36:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:15,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-19 00:36:15,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:15,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:15,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-19 00:36:16,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2024-11-19 00:36:16,792 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 87 treesize of output 70 [2024-11-19 00:36:18,893 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 124 treesize of output 94 [2024-11-19 00:36:19,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:19,521 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 131 treesize of output 61 [2024-11-19 00:36:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 351 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-19 00:36:19,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:36:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:36:20,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:20,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259457099] [2024-11-19 00:36:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259457099] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:36:20,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:36:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [41] total 46 [2024-11-19 00:36:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147879751] [2024-11-19 00:36:20,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:20,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:36:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:20,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:36:20,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1721, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 00:36:20,410 INFO L87 Difference]: Start difference. First operand 238 states and 348 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:36:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:21,229 INFO L93 Difference]: Finished difference Result 533 states and 779 transitions. [2024-11-19 00:36:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:36:21,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-11-19 00:36:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:21,231 INFO L225 Difference]: With dead ends: 533 [2024-11-19 00:36:21,231 INFO L226 Difference]: Without dead ends: 298 [2024-11-19 00:36:21,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=365, Invalid=1891, Unknown=0, NotChecked=0, Total=2256 [2024-11-19 00:36:21,233 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 109 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:21,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 863 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:36:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-19 00:36:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 236. [2024-11-19 00:36:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 208 states have (on average 1.4375) internal successors, (299), 209 states have internal predecessors, (299), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:36:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 345 transitions. [2024-11-19 00:36:21,244 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 345 transitions. Word has length 127 [2024-11-19 00:36:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:21,244 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 345 transitions. [2024-11-19 00:36:21,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:36:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 345 transitions. [2024-11-19 00:36:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:36:21,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:21,247 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:36:21,258 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 (9)] Forceful destruction successful, exit code 0 [2024-11-19 00:36:21,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:36:21,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:21,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash -584009745, now seen corresponding path program 1 times [2024-11-19 00:36:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717138164] [2024-11-19 00:36:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:21,452 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-11-19 00:36:21,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:21,454 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-11-19 00:36:21,456 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-11-19 00:36:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:21,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 00:36:21,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:21,846 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-11-19 00:36:21,849 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-11-19 00:36:21,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-19 00:36:21,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-19 00:36:21,977 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 21 treesize of output 17 [2024-11-19 00:36:22,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2024-11-19 00:36:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-19 00:36:22,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:36:22,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:36:22,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717138164] [2024-11-19 00:36:22,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717138164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:36:22,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:36:22,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:36:22,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801909716] [2024-11-19 00:36:22,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:36:22,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:36:22,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:36:22,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:36:22,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:36:22,140 INFO L87 Difference]: Start difference. First operand 236 states and 345 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:36:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:36:23,412 INFO L93 Difference]: Finished difference Result 690 states and 994 transitions. [2024-11-19 00:36:23,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:36:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-19 00:36:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:36:23,416 INFO L225 Difference]: With dead ends: 690 [2024-11-19 00:36:23,416 INFO L226 Difference]: Without dead ends: 457 [2024-11-19 00:36:23,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:36:23,417 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 515 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:36:23,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 717 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 00:36:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-19 00:36:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 237. [2024-11-19 00:36:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 209 states have (on average 1.4354066985645932) internal successors, (300), 210 states have internal predecessors, (300), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:36:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 346 transitions. [2024-11-19 00:36:23,433 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 346 transitions. Word has length 128 [2024-11-19 00:36:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:36:23,433 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 346 transitions. [2024-11-19 00:36:23,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:36:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 346 transitions. [2024-11-19 00:36:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 00:36:23,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:36:23,435 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 00:36:23,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 00:36:23,638 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-11-19 00:36:23,639 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:36:23,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:36:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1011601530, now seen corresponding path program 1 times [2024-11-19 00:36:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:36:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325928705] [2024-11-19 00:36:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:36:23,643 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-11-19 00:36:23,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:36:23,644 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-11-19 00:36:23,646 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-11-19 00:36:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:36:24,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 00:36:24,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:36:24,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:36:24,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-19 00:36:24,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:36:24,637 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 128 treesize of output 65