./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX --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 4714a0c6536056117a4ee0063fda0c81448928e693130365c60e5088462281df --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:41:36,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:41:36,778 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:41:36,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:41:36,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:41:36,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:41:36,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:41:36,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:41:36,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:41:36,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:41:36,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:41:36,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:41:36,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:41:36,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:41:36,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:41:36,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:41:36,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:41:36,854 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:41:36,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:41:36,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:41:36,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:41:36,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:41:36,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:41:36,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:41:36,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:41:36,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:41:36,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:41:36,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:41:36,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:41:36,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:41:36,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:41:36,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:41:36,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:41:36,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:41:36,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:41:36,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:41:36,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:41:36,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:41:36,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:41:36,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:41:36,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:41:36,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:41:36,869 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX 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 -> 4714a0c6536056117a4ee0063fda0c81448928e693130365c60e5088462281df [2024-11-08 16:41:37,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:41:37,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:41:37,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:41:37,370 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:41:37,371 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:41:37,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i Unable to find full path for "g++" [2024-11-08 16:41:39,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:41:39,943 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:41:39,947 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i [2024-11-08 16:41:39,967 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/data/5dc0e5115/1cee8f412fc5464fb2c72d58ec213230/FLAG00790366d [2024-11-08 16:41:39,997 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/data/5dc0e5115/1cee8f412fc5464fb2c72d58ec213230 [2024-11-08 16:41:40,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:41:40,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:41:40,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:41:40,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:41:40,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:41:40,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:41:39" (1/1) ... [2024-11-08 16:41:40,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdbf9e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40, skipping insertion in model container [2024-11-08 16:41:40,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:41:39" (1/1) ... [2024-11-08 16:41:40,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:41:40,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i[916,929] [2024-11-08 16:41:40,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:41:40,525 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:41:40,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i[916,929] [2024-11-08 16:41:40,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:41:40,622 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:41:40,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40 WrapperNode [2024-11-08 16:41:40,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:41:40,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:41:40,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:41:40,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:41:40,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,724 INFO L138 Inliner]: procedures = 30, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2024-11-08 16:41:40,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:41:40,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:41:40,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:41:40,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:41:40,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,765 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 16:41:40,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:41:40,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:41:40,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:41:40,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:41:40,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (1/1) ... [2024-11-08 16:41:40,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:41:40,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:41:40,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:41:40,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:41:40,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:41:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 16:41:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 16:41:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 16:41:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:41:40,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 16:41:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:41:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:41:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:41:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:41:40,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:41:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:41:41,174 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:41:41,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:41:42,085 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-08 16:41:42,085 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:41:42,112 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:41:42,113 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:41:42,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:41:42 BoogieIcfgContainer [2024-11-08 16:41:42,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:41:42,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:41:42,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:41:42,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:41:42,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:41:39" (1/3) ... [2024-11-08 16:41:42,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402f6c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:41:42, skipping insertion in model container [2024-11-08 16:41:42,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:41:40" (2/3) ... [2024-11-08 16:41:42,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402f6c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:41:42, skipping insertion in model container [2024-11-08 16:41:42,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:41:42" (3/3) ... [2024-11-08 16:41:42,130 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-4.i [2024-11-08 16:41:42,151 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:41:42,151 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:41:42,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:41:42,235 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;@624d2a03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:41:42,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:41:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:41:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:41:42,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:41:42,265 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:41:42,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:41:42,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:41:42,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1249203589, now seen corresponding path program 1 times [2024-11-08 16:41:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:41:42,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38414402] [2024-11-08 16:41:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:41:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:41:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:42,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:41:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:41:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:41:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:41:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:41:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:41:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:41:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:41:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:41:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:41:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:41:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:41:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:41:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:41:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:41:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:41:43,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:41:43,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38414402] [2024-11-08 16:41:43,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38414402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:41:43,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:41:43,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:41:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241856926] [2024-11-08 16:41:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:41:43,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:41:43,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:41:43,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:41:43,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:41:43,211 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:41:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:41:43,271 INFO L93 Difference]: Finished difference Result 213 states and 331 transitions. [2024-11-08 16:41:43,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:41:43,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-08 16:41:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:41:43,288 INFO L225 Difference]: With dead ends: 213 [2024-11-08 16:41:43,288 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 16:41:43,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-08 16:41:43,303 INFO L432 NwaCegarLoop]: 154 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, 154 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-08 16:41:43,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:41:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 16:41:43,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-08 16:41:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:41:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-08 16:41:43,385 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2024-11-08 16:41:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:41:43,386 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-08 16:41:43,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:41:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-08 16:41:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:41:43,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:41:43,395 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:41:43,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:41:43,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:41:43,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:41:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1753827379, now seen corresponding path program 1 times [2024-11-08 16:41:43,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:41:43,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875962186] [2024-11-08 16:41:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:41:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:41:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:41:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:41:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:41:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:41:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:41:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:41:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:41:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:41:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:41:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:41:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:41:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:41:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:41:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:41:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:41:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:41:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:41:44,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875962186] [2024-11-08 16:41:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875962186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:41:44,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:41:44,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:41:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719870895] [2024-11-08 16:41:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:41:44,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:41:44,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:41:44,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:41:44,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:41:44,185 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:41:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:41:44,282 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2024-11-08 16:41:44,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:41:44,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-08 16:41:44,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:41:44,287 INFO L225 Difference]: With dead ends: 211 [2024-11-08 16:41:44,287 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 16:41:44,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:41:44,290 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:41:44,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:41:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 16:41:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 16:41:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:41:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-08 16:41:44,315 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2024-11-08 16:41:44,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:41:44,317 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-08 16:41:44,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:41:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-08 16:41:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:41:44,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:41:44,322 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:41:44,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:41:44,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:41:44,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:41:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1216283723, now seen corresponding path program 1 times [2024-11-08 16:41:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:41:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778312561] [2024-11-08 16:41:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:41:44,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:41:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:41:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:41:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:41:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:41:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:41:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:41:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:41:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:41:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:41:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:41:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:41:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:41:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:41:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:41:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:41:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:41:44,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:41:44,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778312561] [2024-11-08 16:41:44,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778312561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:41:44,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:41:44,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:41:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574605365] [2024-11-08 16:41:44,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:41:44,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:41:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:41:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:41:44,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:41:44,845 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:41:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:41:44,913 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-08 16:41:44,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:41:44,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 16:41:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:41:44,916 INFO L225 Difference]: With dead ends: 216 [2024-11-08 16:41:44,916 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 16:41:44,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:41:44,922 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:41:44,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:41:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 16:41:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 16:41:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:41:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-08 16:41:44,940 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 130 [2024-11-08 16:41:44,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:41:44,941 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-08 16:41:44,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:41:44,942 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-08 16:41:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:41:44,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:41:44,945 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:41:44,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:41:44,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:41:44,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:41:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1218130765, now seen corresponding path program 1 times [2024-11-08 16:41:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:41:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656764957] [2024-11-08 16:41:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:41:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:41:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:41:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:41:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:41:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:41:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:41:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:41:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:41:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:41:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:41:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:41:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:41:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:41:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:41:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:41:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:41:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:41:47,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:41:47,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656764957] [2024-11-08 16:41:47,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656764957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:41:47,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:41:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:41:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44923056] [2024-11-08 16:41:47,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:41:47,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:41:47,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:41:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:41:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:41:47,273 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:41:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:41:48,513 INFO L93 Difference]: Finished difference Result 254 states and 364 transitions. [2024-11-08 16:41:48,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:41:48,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 16:41:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:41:48,517 INFO L225 Difference]: With dead ends: 254 [2024-11-08 16:41:48,517 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 16:41:48,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:41:48,524 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 197 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:41:48,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 580 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:41:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 16:41:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 120. [2024-11-08 16:41:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:41:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2024-11-08 16:41:48,542 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 130 [2024-11-08 16:41:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:41:48,543 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2024-11-08 16:41:48,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:41:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2024-11-08 16:41:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:41:48,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:41:48,547 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:41:48,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:41:48,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:41:48,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:41:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1919195343, now seen corresponding path program 1 times [2024-11-08 16:41:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:41:48,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660480642] [2024-11-08 16:41:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:41:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:41:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:41:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:41:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:41:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:41:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:41:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:41:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:41:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:41:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:41:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:41:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:41:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:41:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:41:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:41:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:41:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:41:48,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:41:48,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660480642] [2024-11-08 16:41:48,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660480642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:41:48,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:41:48,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:41:48,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816131154] [2024-11-08 16:41:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:41:48,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:41:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:41:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:41:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:41:48,923 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:41:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:41:48,953 INFO L93 Difference]: Finished difference Result 241 states and 347 transitions. [2024-11-08 16:41:48,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:41:48,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 16:41:48,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:41:48,956 INFO L225 Difference]: With dead ends: 241 [2024-11-08 16:41:48,956 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 16:41:48,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:41:48,957 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:41:48,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:41:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 16:41:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-08 16:41:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:41:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-11-08 16:41:48,970 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 130 [2024-11-08 16:41:48,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:41:48,970 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-11-08 16:41:48,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:41:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-11-08 16:41:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 16:41:48,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:41:48,973 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:41:48,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:41:48,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:41:48,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:41:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash -758773887, now seen corresponding path program 1 times [2024-11-08 16:41:48,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:41:48,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620222494] [2024-11-08 16:41:48,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:41:48,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:41:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:41:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:41:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:41:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:41:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:41:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:41:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:41:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:41:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:41:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:41:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:41:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:41:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:41:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:41:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:41:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:41:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:41:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620222494] [2024-11-08 16:41:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620222494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:41:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:41:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:41:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855131645] [2024-11-08 16:41:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:41:49,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:41:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:41:49,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:41:49,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:41:49,350 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:41:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:41:49,401 INFO L93 Difference]: Finished difference Result 251 states and 357 transitions. [2024-11-08 16:41:49,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:41:49,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-08 16:41:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:41:49,405 INFO L225 Difference]: With dead ends: 251 [2024-11-08 16:41:49,406 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 16:41:49,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:41:49,408 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:41:49,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:41:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 16:41:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2024-11-08 16:41:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 109 states have internal predecessors, (148), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:41:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2024-11-08 16:41:49,431 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 132 [2024-11-08 16:41:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:41:49,432 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2024-11-08 16:41:49,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:41:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2024-11-08 16:41:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:41:49,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:41:49,436 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:41:49,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:41:49,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:41:49,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:41:49,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1558824489, now seen corresponding path program 1 times [2024-11-08 16:41:49,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:41:49,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713628299] [2024-11-08 16:41:49,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:41:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:41:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:54,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:41:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:54,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:41:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:41:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:41:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:54,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:41:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:54,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:41:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:55,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:41:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:55,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:41:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:41:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:41:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:55,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:41:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:55,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:41:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:41:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:55,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:41:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:55,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:41:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:41:55,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:41:55,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713628299] [2024-11-08 16:41:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713628299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:41:55,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:41:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:41:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045495653] [2024-11-08 16:41:55,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:41:55,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:41:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:41:55,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:41:55,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:41:55,166 INFO L87 Difference]: Start difference. First operand 126 states and 178 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:41:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:41:57,799 INFO L93 Difference]: Finished difference Result 302 states and 425 transitions. [2024-11-08 16:41:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:41:57,801 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2024-11-08 16:41:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:41:57,803 INFO L225 Difference]: With dead ends: 302 [2024-11-08 16:41:57,804 INFO L226 Difference]: Without dead ends: 179 [2024-11-08 16:41:57,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:41:57,806 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 309 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:41:57,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 510 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 16:41:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-08 16:41:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 136. [2024-11-08 16:41:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 119 states have internal predecessors, (163), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:41:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 193 transitions. [2024-11-08 16:41:57,832 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 193 transitions. Word has length 133 [2024-11-08 16:41:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:41:57,832 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 193 transitions. [2024-11-08 16:41:57,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:41:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 193 transitions. [2024-11-08 16:41:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:41:57,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:41:57,836 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:41:57,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:41:57,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:41:57,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:41:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1715074453, now seen corresponding path program 1 times [2024-11-08 16:41:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:41:57,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417878476] [2024-11-08 16:41:57,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:41:57,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:41:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:42:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:42:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:42:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:42:03,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:03,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417878476] [2024-11-08 16:42:03,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417878476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:03,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:03,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 16:42:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758931365] [2024-11-08 16:42:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:03,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:42:03,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:03,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:42:03,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:42:03,286 INFO L87 Difference]: Start difference. First operand 136 states and 193 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:42:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:06,580 INFO L93 Difference]: Finished difference Result 328 states and 460 transitions. [2024-11-08 16:42:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 16:42:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2024-11-08 16:42:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:06,583 INFO L225 Difference]: With dead ends: 328 [2024-11-08 16:42:06,584 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 16:42:06,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2024-11-08 16:42:06,586 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 497 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:06,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 579 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 16:42:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 16:42:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 176. [2024-11-08 16:42:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 154 states have internal predecessors, (207), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 16:42:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 247 transitions. [2024-11-08 16:42:06,613 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 247 transitions. Word has length 133 [2024-11-08 16:42:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:06,614 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 247 transitions. [2024-11-08 16:42:06,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:42:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 247 transitions. [2024-11-08 16:42:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:42:06,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:06,620 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:06,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:42:06,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:06,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:06,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1115323482, now seen corresponding path program 1 times [2024-11-08 16:42:06,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:06,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701096503] [2024-11-08 16:42:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:06,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:10,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:10,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:10,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:42:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:10,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:10,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:42:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:11,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:42:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:11,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:11,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:42:11,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701096503] [2024-11-08 16:42:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701096503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:11,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:42:11,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623913449] [2024-11-08 16:42:11,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:11,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:42:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:42:11,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:42:11,118 INFO L87 Difference]: Start difference. First operand 176 states and 247 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:42:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:13,780 INFO L93 Difference]: Finished difference Result 354 states and 495 transitions. [2024-11-08 16:42:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:42:13,781 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 16:42:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:13,786 INFO L225 Difference]: With dead ends: 354 [2024-11-08 16:42:13,787 INFO L226 Difference]: Without dead ends: 181 [2024-11-08 16:42:13,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:42:13,788 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 588 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:13,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 516 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:42:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-08 16:42:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2024-11-08 16:42:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.34640522875817) internal successors, (206), 154 states have internal predecessors, (206), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 16:42:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 246 transitions. [2024-11-08 16:42:13,819 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 246 transitions. Word has length 134 [2024-11-08 16:42:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:13,820 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 246 transitions. [2024-11-08 16:42:13,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:42:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 246 transitions. [2024-11-08 16:42:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:42:13,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:13,824 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:13,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:42:13,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:13,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1899780136, now seen corresponding path program 1 times [2024-11-08 16:42:13,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:13,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695808296] [2024-11-08 16:42:13,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:13,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:42:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:42:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:42:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:42:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695808296] [2024-11-08 16:42:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695808296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:42:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939026642] [2024-11-08 16:42:15,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:15,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:42:15,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:42:15,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:42:15,392 INFO L87 Difference]: Start difference. First operand 176 states and 246 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:42:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:16,323 INFO L93 Difference]: Finished difference Result 409 states and 568 transitions. [2024-11-08 16:42:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:42:16,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 16:42:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:16,326 INFO L225 Difference]: With dead ends: 409 [2024-11-08 16:42:16,327 INFO L226 Difference]: Without dead ends: 236 [2024-11-08 16:42:16,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:42:16,328 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 38 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:16,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 429 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:42:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-08 16:42:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 180. [2024-11-08 16:42:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.3375796178343948) internal successors, (210), 158 states have internal predecessors, (210), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 16:42:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 250 transitions. [2024-11-08 16:42:16,372 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 250 transitions. Word has length 134 [2024-11-08 16:42:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:16,373 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 250 transitions. [2024-11-08 16:42:16,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:42:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 250 transitions. [2024-11-08 16:42:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:42:16,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:16,376 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:16,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:42:16,377 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:16,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1415786277, now seen corresponding path program 1 times [2024-11-08 16:42:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:16,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383613686] [2024-11-08 16:42:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:42:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:42:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:42:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:42:19,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383613686] [2024-11-08 16:42:19,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383613686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:19,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:19,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:42:19,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082771478] [2024-11-08 16:42:19,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:19,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:42:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:19,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:42:19,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:42:19,554 INFO L87 Difference]: Start difference. First operand 180 states and 250 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:42:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:21,927 INFO L93 Difference]: Finished difference Result 404 states and 561 transitions. [2024-11-08 16:42:21,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:42:21,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 16:42:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:21,932 INFO L225 Difference]: With dead ends: 404 [2024-11-08 16:42:21,932 INFO L226 Difference]: Without dead ends: 227 [2024-11-08 16:42:21,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:42:21,934 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 209 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:21,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 444 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 16:42:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-08 16:42:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 204. [2024-11-08 16:42:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.3370165745856353) internal successors, (242), 182 states have internal predecessors, (242), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 16:42:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 282 transitions. [2024-11-08 16:42:21,993 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 282 transitions. Word has length 134 [2024-11-08 16:42:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:21,994 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 282 transitions. [2024-11-08 16:42:21,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:42:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 282 transitions. [2024-11-08 16:42:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:42:21,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:21,997 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:21,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:42:21,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:21,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1816216156, now seen corresponding path program 1 times [2024-11-08 16:42:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:21,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818936928] [2024-11-08 16:42:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:21,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:42:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:42:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:42:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:42:26,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:26,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818936928] [2024-11-08 16:42:26,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818936928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:26,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:26,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 16:42:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904363021] [2024-11-08 16:42:26,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:26,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:42:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:26,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:42:26,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:42:26,705 INFO L87 Difference]: Start difference. First operand 204 states and 282 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:42:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:29,583 INFO L93 Difference]: Finished difference Result 412 states and 568 transitions. [2024-11-08 16:42:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:42:29,584 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-08 16:42:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:29,587 INFO L225 Difference]: With dead ends: 412 [2024-11-08 16:42:29,587 INFO L226 Difference]: Without dead ends: 211 [2024-11-08 16:42:29,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2024-11-08 16:42:29,589 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 428 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:29,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 736 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:42:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-08 16:42:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-08 16:42:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.3297297297297297) internal successors, (246), 186 states have internal predecessors, (246), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 16:42:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 286 transitions. [2024-11-08 16:42:29,627 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 286 transitions. Word has length 134 [2024-11-08 16:42:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:29,628 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 286 transitions. [2024-11-08 16:42:29,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:42:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 286 transitions. [2024-11-08 16:42:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:42:29,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:29,631 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:29,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:42:29,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:29,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1115151578, now seen corresponding path program 1 times [2024-11-08 16:42:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772804549] [2024-11-08 16:42:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:42:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:42:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:42:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:42:35,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:35,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772804549] [2024-11-08 16:42:35,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772804549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:35,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:35,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:42:35,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479812488] [2024-11-08 16:42:35,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:35,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:42:35,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:35,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:42:35,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:42:35,965 INFO L87 Difference]: Start difference. First operand 208 states and 286 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:42:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:37,971 INFO L93 Difference]: Finished difference Result 426 states and 583 transitions. [2024-11-08 16:42:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:42:37,974 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 16:42:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:37,976 INFO L225 Difference]: With dead ends: 426 [2024-11-08 16:42:37,976 INFO L226 Difference]: Without dead ends: 221 [2024-11-08 16:42:37,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:42:37,979 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 353 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:37,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 527 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 16:42:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-08 16:42:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2024-11-08 16:42:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 190 states have (on average 1.3157894736842106) internal successors, (250), 192 states have internal predecessors, (250), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:42:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 296 transitions. [2024-11-08 16:42:38,027 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 296 transitions. Word has length 134 [2024-11-08 16:42:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:38,030 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 296 transitions. [2024-11-08 16:42:38,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:42:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 296 transitions. [2024-11-08 16:42:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:42:38,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:38,033 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:38,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:42:38,034 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:38,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:38,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1675667546, now seen corresponding path program 1 times [2024-11-08 16:42:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:38,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770794294] [2024-11-08 16:42:38,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:38,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:42:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:44,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:42:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:42:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:44,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:44,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:44,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:42:44,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:44,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770794294] [2024-11-08 16:42:44,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770794294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:44,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:44,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:42:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766790697] [2024-11-08 16:42:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:44,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:42:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:42:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:42:44,127 INFO L87 Difference]: Start difference. First operand 217 states and 296 transitions. Second operand has 15 states, 13 states have (on average 4.769230769230769) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:42:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:46,955 INFO L93 Difference]: Finished difference Result 491 states and 662 transitions. [2024-11-08 16:42:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:42:46,956 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.769230769230769) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 16:42:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:46,959 INFO L225 Difference]: With dead ends: 491 [2024-11-08 16:42:46,961 INFO L226 Difference]: Without dead ends: 282 [2024-11-08 16:42:46,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:42:46,963 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 588 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:46,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 627 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:42:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-08 16:42:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 242. [2024-11-08 16:42:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 214 states have (on average 1.3130841121495327) internal successors, (281), 216 states have internal predecessors, (281), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:42:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 327 transitions. [2024-11-08 16:42:47,020 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 327 transitions. Word has length 134 [2024-11-08 16:42:47,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:47,020 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 327 transitions. [2024-11-08 16:42:47,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.769230769230769) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:42:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 327 transitions. [2024-11-08 16:42:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:42:47,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:47,023 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:47,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:42:47,024 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash -974602968, now seen corresponding path program 1 times [2024-11-08 16:42:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:47,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049110717] [2024-11-08 16:42:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:42:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:42:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:42:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:42:51,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:51,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049110717] [2024-11-08 16:42:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049110717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:51,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:42:51,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352451294] [2024-11-08 16:42:51,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:51,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:42:51,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:51,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:42:51,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:42:51,465 INFO L87 Difference]: Start difference. First operand 242 states and 327 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:42:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:42:54,268 INFO L93 Difference]: Finished difference Result 507 states and 684 transitions. [2024-11-08 16:42:54,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:42:54,270 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-08 16:42:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:42:54,274 INFO L225 Difference]: With dead ends: 507 [2024-11-08 16:42:54,274 INFO L226 Difference]: Without dead ends: 268 [2024-11-08 16:42:54,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:42:54,276 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 166 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:42:54,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1067 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 16:42:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-08 16:42:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 247. [2024-11-08 16:42:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 219 states have (on average 1.3059360730593608) internal successors, (286), 221 states have internal predecessors, (286), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:42:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 332 transitions. [2024-11-08 16:42:54,329 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 332 transitions. Word has length 134 [2024-11-08 16:42:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:42:54,330 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 332 transitions. [2024-11-08 16:42:54,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:42:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 332 transitions. [2024-11-08 16:42:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:42:54,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:42:54,333 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:54,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:42:54,333 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:42:54,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:42:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1040283602, now seen corresponding path program 1 times [2024-11-08 16:42:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:42:54,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819239055] [2024-11-08 16:42:54,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:42:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:42:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:42:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:42:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:42:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:42:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:42:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:42:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:42:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:42:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:42:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:42:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:42:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:42:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:42:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:42:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:42:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:42:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:42:58,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:42:58,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819239055] [2024-11-08 16:42:58,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819239055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 16:42:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471125347] [2024-11-08 16:42:58,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:58,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:42:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:42:58,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:42:58,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:42:58,366 INFO L87 Difference]: Start difference. First operand 247 states and 332 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:43:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:00,971 INFO L93 Difference]: Finished difference Result 575 states and 774 transitions. [2024-11-08 16:43:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:43:00,973 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-08 16:43:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:00,975 INFO L225 Difference]: With dead ends: 575 [2024-11-08 16:43:00,976 INFO L226 Difference]: Without dead ends: 331 [2024-11-08 16:43:00,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2024-11-08 16:43:00,978 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 244 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:00,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 939 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 16:43:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-08 16:43:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 282. [2024-11-08 16:43:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 254 states have (on average 1.3188976377952757) internal successors, (335), 256 states have internal predecessors, (335), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:43:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 381 transitions. [2024-11-08 16:43:01,033 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 381 transitions. Word has length 134 [2024-11-08 16:43:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:01,034 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 381 transitions. [2024-11-08 16:43:01,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:43:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 381 transitions. [2024-11-08 16:43:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:43:01,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:01,036 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:01,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:43:01,037 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:01,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1741348180, now seen corresponding path program 1 times [2024-11-08 16:43:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:01,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112331073] [2024-11-08 16:43:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:43:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:43:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:43:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:43:05,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:05,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112331073] [2024-11-08 16:43:05,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112331073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:05,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:05,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:43:05,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284257555] [2024-11-08 16:43:05,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:05,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:43:05,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:05,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:43:05,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:43:05,932 INFO L87 Difference]: Start difference. First operand 282 states and 381 transitions. Second operand has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:43:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:08,012 INFO L93 Difference]: Finished difference Result 627 states and 842 transitions. [2024-11-08 16:43:08,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:43:08,012 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 16:43:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:08,014 INFO L225 Difference]: With dead ends: 627 [2024-11-08 16:43:08,015 INFO L226 Difference]: Without dead ends: 348 [2024-11-08 16:43:08,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:43:08,017 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 400 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:08,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 593 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 16:43:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-08 16:43:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 278. [2024-11-08 16:43:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 250 states have (on average 1.32) internal successors, (330), 252 states have internal predecessors, (330), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:43:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 376 transitions. [2024-11-08 16:43:08,079 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 376 transitions. Word has length 134 [2024-11-08 16:43:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:08,080 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 376 transitions. [2024-11-08 16:43:08,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:43:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 376 transitions. [2024-11-08 16:43:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:43:08,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:08,082 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:08,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:43:08,083 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:08,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:08,083 INFO L85 PathProgramCache]: Analyzing trace with hash 639853723, now seen corresponding path program 1 times [2024-11-08 16:43:08,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:08,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129929265] [2024-11-08 16:43:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:08,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:43:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:43:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:43:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:43:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129929265] [2024-11-08 16:43:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129929265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:43:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234538996] [2024-11-08 16:43:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:14,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:43:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:14,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:43:14,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:43:14,847 INFO L87 Difference]: Start difference. First operand 278 states and 376 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:43:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:25,737 INFO L93 Difference]: Finished difference Result 634 states and 855 transitions. [2024-11-08 16:43:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:43:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-08 16:43:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:25,741 INFO L225 Difference]: With dead ends: 634 [2024-11-08 16:43:25,741 INFO L226 Difference]: Without dead ends: 359 [2024-11-08 16:43:25,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:43:25,743 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 213 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:25,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 482 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-08 16:43:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-08 16:43:25,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 293. [2024-11-08 16:43:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 265 states have (on average 1.3094339622641509) internal successors, (347), 267 states have internal predecessors, (347), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:43:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 393 transitions. [2024-11-08 16:43:25,797 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 393 transitions. Word has length 134 [2024-11-08 16:43:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:25,798 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 393 transitions. [2024-11-08 16:43:25,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:43:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 393 transitions. [2024-11-08 16:43:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:43:25,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:25,800 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:25,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:43:25,801 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:25,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1180832212, now seen corresponding path program 1 times [2024-11-08 16:43:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:25,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511105210] [2024-11-08 16:43:25,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:43:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:43:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:43:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:43:30,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:30,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511105210] [2024-11-08 16:43:30,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511105210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:30,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:30,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:43:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495920566] [2024-11-08 16:43:30,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:30,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:43:30,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:30,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:43:30,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:43:30,782 INFO L87 Difference]: Start difference. First operand 293 states and 393 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:43:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:32,930 INFO L93 Difference]: Finished difference Result 658 states and 878 transitions. [2024-11-08 16:43:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:43:32,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 16:43:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:32,934 INFO L225 Difference]: With dead ends: 658 [2024-11-08 16:43:32,934 INFO L226 Difference]: Without dead ends: 368 [2024-11-08 16:43:32,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:43:32,936 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 398 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:32,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 530 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 16:43:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-08 16:43:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 293. [2024-11-08 16:43:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 265 states have (on average 1.3094339622641509) internal successors, (347), 267 states have internal predecessors, (347), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:43:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 393 transitions. [2024-11-08 16:43:33,003 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 393 transitions. Word has length 134 [2024-11-08 16:43:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:33,004 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 393 transitions. [2024-11-08 16:43:33,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:43:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 393 transitions. [2024-11-08 16:43:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:43:33,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:33,006 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:33,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:43:33,007 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:33,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1881896790, now seen corresponding path program 1 times [2024-11-08 16:43:33,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:33,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951026911] [2024-11-08 16:43:33,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:33,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:43:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:43:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:43:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:43:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:36,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951026911] [2024-11-08 16:43:36,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951026911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:36,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:36,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:43:36,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129377406] [2024-11-08 16:43:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:36,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:43:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:43:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:43:36,712 INFO L87 Difference]: Start difference. First operand 293 states and 393 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:43:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:39,603 INFO L93 Difference]: Finished difference Result 610 states and 817 transitions. [2024-11-08 16:43:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:43:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-08 16:43:39,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:39,607 INFO L225 Difference]: With dead ends: 610 [2024-11-08 16:43:39,607 INFO L226 Difference]: Without dead ends: 320 [2024-11-08 16:43:39,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:43:39,609 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 166 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:39,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 996 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 16:43:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-08 16:43:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 293. [2024-11-08 16:43:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 265 states have (on average 1.3094339622641509) internal successors, (347), 267 states have internal predecessors, (347), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:43:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 393 transitions. [2024-11-08 16:43:39,687 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 393 transitions. Word has length 134 [2024-11-08 16:43:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:39,688 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 393 transitions. [2024-11-08 16:43:39,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:43:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 393 transitions. [2024-11-08 16:43:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 16:43:39,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:39,691 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:39,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:43:39,692 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:39,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1559668553, now seen corresponding path program 1 times [2024-11-08 16:43:39,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:39,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503002619] [2024-11-08 16:43:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:39,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:43:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:43:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:43:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:43:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:41,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503002619] [2024-11-08 16:43:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503002619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:41,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:41,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:43:41,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182580547] [2024-11-08 16:43:41,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:41,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:43:41,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:41,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:43:41,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:43:41,998 INFO L87 Difference]: Start difference. First operand 293 states and 393 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:43:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:43,255 INFO L93 Difference]: Finished difference Result 627 states and 829 transitions. [2024-11-08 16:43:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:43:43,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2024-11-08 16:43:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:43,259 INFO L225 Difference]: With dead ends: 627 [2024-11-08 16:43:43,260 INFO L226 Difference]: Without dead ends: 337 [2024-11-08 16:43:43,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:43:43,263 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 265 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:43,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 365 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:43:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-08 16:43:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 261. [2024-11-08 16:43:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 233 states have (on average 1.2875536480686696) internal successors, (300), 235 states have internal predecessors, (300), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:43:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 346 transitions. [2024-11-08 16:43:43,352 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 346 transitions. Word has length 135 [2024-11-08 16:43:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:43,353 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 346 transitions. [2024-11-08 16:43:43,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:43:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 346 transitions. [2024-11-08 16:43:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:43:43,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:43,355 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:43,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 16:43:43,355 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:43,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1298070941, now seen corresponding path program 1 times [2024-11-08 16:43:43,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:43,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754952017] [2024-11-08 16:43:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:43,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:43:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:43:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:43:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:43:44,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:44,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754952017] [2024-11-08 16:43:44,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754952017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:44,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:44,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:43:44,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363700142] [2024-11-08 16:43:44,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:44,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:43:44,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:44,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:43:44,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:43:44,825 INFO L87 Difference]: Start difference. First operand 261 states and 346 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:43:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:46,193 INFO L93 Difference]: Finished difference Result 292 states and 382 transitions. [2024-11-08 16:43:46,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:43:46,194 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 16:43:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:46,196 INFO L225 Difference]: With dead ends: 292 [2024-11-08 16:43:46,196 INFO L226 Difference]: Without dead ends: 290 [2024-11-08 16:43:46,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:43:46,198 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 347 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:46,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 724 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 16:43:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-08 16:43:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 267. [2024-11-08 16:43:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.2803347280334727) internal successors, (306), 241 states have internal predecessors, (306), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:43:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 352 transitions. [2024-11-08 16:43:46,272 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 352 transitions. Word has length 137 [2024-11-08 16:43:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:46,273 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 352 transitions. [2024-11-08 16:43:46,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:43:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 352 transitions. [2024-11-08 16:43:46,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:43:46,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:46,275 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:46,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 16:43:46,276 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1299917983, now seen corresponding path program 1 times [2024-11-08 16:43:46,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:46,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454252225] [2024-11-08 16:43:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:46,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:43:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:43:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:43:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:43:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:43:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:43:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:43:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:43:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:43:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:43:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:43:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:43:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:43:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:43:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:43:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:43:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:43:53,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:43:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454252225] [2024-11-08 16:43:53,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454252225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:43:53,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:43:53,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 16:43:53,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641279591] [2024-11-08 16:43:53,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:43:53,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:43:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:43:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:43:53,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:43:53,373 INFO L87 Difference]: Start difference. First operand 267 states and 352 transitions. Second operand has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:43:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:43:57,543 INFO L93 Difference]: Finished difference Result 578 states and 755 transitions. [2024-11-08 16:43:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:43:57,544 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-08 16:43:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:43:57,546 INFO L225 Difference]: With dead ends: 578 [2024-11-08 16:43:57,546 INFO L226 Difference]: Without dead ends: 314 [2024-11-08 16:43:57,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2024-11-08 16:43:57,548 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 322 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:43:57,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 832 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 16:43:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-08 16:43:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 291. [2024-11-08 16:43:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 263 states have (on average 1.273764258555133) internal successors, (335), 265 states have internal predecessors, (335), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:43:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 381 transitions. [2024-11-08 16:43:57,599 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 381 transitions. Word has length 137 [2024-11-08 16:43:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:43:57,599 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 381 transitions. [2024-11-08 16:43:57,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:43:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 381 transitions. [2024-11-08 16:43:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:43:57,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:43:57,601 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:57,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 16:43:57,602 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:43:57,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:43:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1914052114, now seen corresponding path program 1 times [2024-11-08 16:43:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:43:57,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993357967] [2024-11-08 16:43:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:43:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:43:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:44:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:44:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:44:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:44:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:44:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:44:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:44:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:44:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:44:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:44:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:44:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:44:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:44:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:44:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:44:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:44:00,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:44:00,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993357967] [2024-11-08 16:44:00,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993357967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:00,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:00,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:44:00,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152767093] [2024-11-08 16:44:00,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:00,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:44:00,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:44:00,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:44:00,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:44:00,220 INFO L87 Difference]: Start difference. First operand 291 states and 381 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:44:02,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:02,241 INFO L93 Difference]: Finished difference Result 651 states and 851 transitions. [2024-11-08 16:44:02,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:44:02,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2024-11-08 16:44:02,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:02,244 INFO L225 Difference]: With dead ends: 651 [2024-11-08 16:44:02,244 INFO L226 Difference]: Without dead ends: 363 [2024-11-08 16:44:02,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:44:02,246 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 510 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:02,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 624 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 16:44:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-08 16:44:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 296. [2024-11-08 16:44:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 268 states have (on average 1.2761194029850746) internal successors, (342), 270 states have internal predecessors, (342), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:44:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 388 transitions. [2024-11-08 16:44:02,294 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 388 transitions. Word has length 137 [2024-11-08 16:44:02,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:02,294 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 388 transitions. [2024-11-08 16:44:02,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:44:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 388 transitions. [2024-11-08 16:44:02,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:44:02,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:02,296 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:02,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 16:44:02,297 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1101051504, now seen corresponding path program 1 times [2024-11-08 16:44:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:44:02,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514553366] [2024-11-08 16:44:02,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:44:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:44:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:44:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:44:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:44:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:44:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:44:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:44:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:44:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:44:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:44:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:44:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:44:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:44:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:44:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:44:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:44:03,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:44:03,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514553366] [2024-11-08 16:44:03,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514553366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:03,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:03,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:44:03,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29691727] [2024-11-08 16:44:03,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:03,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:44:03,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:44:03,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:44:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:44:03,887 INFO L87 Difference]: Start difference. First operand 296 states and 388 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:44:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:05,289 INFO L93 Difference]: Finished difference Result 660 states and 866 transitions. [2024-11-08 16:44:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:44:05,290 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 16:44:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:05,292 INFO L225 Difference]: With dead ends: 660 [2024-11-08 16:44:05,293 INFO L226 Difference]: Without dead ends: 367 [2024-11-08 16:44:05,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:44:05,295 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 250 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:05,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1091 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:44:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-08 16:44:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 302. [2024-11-08 16:44:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 274 states have (on average 1.281021897810219) internal successors, (351), 276 states have internal predecessors, (351), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:44:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 397 transitions. [2024-11-08 16:44:05,379 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 397 transitions. Word has length 137 [2024-11-08 16:44:05,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:05,379 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 397 transitions. [2024-11-08 16:44:05,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:44:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 397 transitions. [2024-11-08 16:44:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:44:05,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:05,381 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:05,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 16:44:05,382 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:05,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:05,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2080452387, now seen corresponding path program 1 times [2024-11-08 16:44:05,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:44:05,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146648583] [2024-11-08 16:44:05,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:05,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:44:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:11,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:44:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:11,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:44:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:44:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:44:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:11,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:44:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:11,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:44:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:44:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:12,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:44:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:12,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:44:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:12,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:44:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:12,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:44:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:44:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:12,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:44:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:12,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:44:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:12,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:44:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:44:12,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:44:12,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146648583] [2024-11-08 16:44:12,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146648583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:12,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:12,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 16:44:12,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674859535] [2024-11-08 16:44:12,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:12,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 16:44:12,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:44:12,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 16:44:12,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:44:12,199 INFO L87 Difference]: Start difference. First operand 302 states and 397 transitions. Second operand has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:44:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:25,639 INFO L93 Difference]: Finished difference Result 692 states and 908 transitions. [2024-11-08 16:44:25,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 16:44:25,640 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-08 16:44:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:25,643 INFO L225 Difference]: With dead ends: 692 [2024-11-08 16:44:25,643 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 16:44:25,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2024-11-08 16:44:25,645 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 946 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:25,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 765 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-08 16:44:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 16:44:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 327. [2024-11-08 16:44:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 299 states have (on average 1.2876254180602007) internal successors, (385), 301 states have internal predecessors, (385), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:44:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 431 transitions. [2024-11-08 16:44:25,740 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 431 transitions. Word has length 137 [2024-11-08 16:44:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:25,741 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 431 transitions. [2024-11-08 16:44:25,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:44:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 431 transitions. [2024-11-08 16:44:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:44:25,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:25,743 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:25,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 16:44:25,744 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:25,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1680022508, now seen corresponding path program 1 times [2024-11-08 16:44:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:44:25,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110785984] [2024-11-08 16:44:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:44:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:44:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:44:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:44:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:44:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:44:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:44:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:44:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:44:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:44:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:44:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:44:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:44:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:30,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:44:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:44:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:31,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:44:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:44:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:44:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110785984] [2024-11-08 16:44:31,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110785984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:31,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:31,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 16:44:31,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526074332] [2024-11-08 16:44:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:31,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 16:44:31,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:44:31,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 16:44:31,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:44:31,024 INFO L87 Difference]: Start difference. First operand 327 states and 431 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:44:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:33,638 INFO L93 Difference]: Finished difference Result 684 states and 899 transitions. [2024-11-08 16:44:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:44:33,639 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2024-11-08 16:44:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:33,641 INFO L225 Difference]: With dead ends: 684 [2024-11-08 16:44:33,641 INFO L226 Difference]: Without dead ends: 360 [2024-11-08 16:44:33,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-11-08 16:44:33,643 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 407 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:33,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 766 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 16:44:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-08 16:44:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 339. [2024-11-08 16:44:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 311 states have (on average 1.279742765273312) internal successors, (398), 313 states have internal predecessors, (398), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:44:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 444 transitions. [2024-11-08 16:44:33,729 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 444 transitions. Word has length 137 [2024-11-08 16:44:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:33,729 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 444 transitions. [2024-11-08 16:44:33,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:44:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 444 transitions. [2024-11-08 16:44:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:44:33,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:33,732 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:33,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 16:44:33,732 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:33,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1913880210, now seen corresponding path program 1 times [2024-11-08 16:44:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:44:33,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689497441] [2024-11-08 16:44:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:33,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:44:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:44:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:44:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:44:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:44:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:44:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:44:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:44:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:44:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:44:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:44:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:44:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:44:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:38,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:44:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:39,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:44:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:39,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:44:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:44:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:44:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689497441] [2024-11-08 16:44:39,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689497441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:39,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:39,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 16:44:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286818740] [2024-11-08 16:44:39,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:39,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 16:44:39,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:44:39,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 16:44:39,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:44:39,039 INFO L87 Difference]: Start difference. First operand 339 states and 444 transitions. Second operand has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:44:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:42,274 INFO L93 Difference]: Finished difference Result 739 states and 963 transitions. [2024-11-08 16:44:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:44:42,275 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-08 16:44:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:42,277 INFO L225 Difference]: With dead ends: 739 [2024-11-08 16:44:42,277 INFO L226 Difference]: Without dead ends: 401 [2024-11-08 16:44:42,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:44:42,279 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 532 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:42,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 587 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 16:44:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-08 16:44:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 343. [2024-11-08 16:44:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 315 states have (on average 1.2793650793650793) internal successors, (403), 317 states have internal predecessors, (403), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:44:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 449 transitions. [2024-11-08 16:44:42,352 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 449 transitions. Word has length 137 [2024-11-08 16:44:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:42,352 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 449 transitions. [2024-11-08 16:44:42,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:44:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 449 transitions. [2024-11-08 16:44:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:44:42,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:42,355 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:42,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 16:44:42,356 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:42,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:42,356 INFO L85 PathProgramCache]: Analyzing trace with hash -220672357, now seen corresponding path program 1 times [2024-11-08 16:44:42,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:44:42,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432846718] [2024-11-08 16:44:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:42,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:44:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:44:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:44:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:44:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:44:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:44:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:44:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:44:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:44:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:44:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:44:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:44:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:44:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:44:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:44:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:44:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:44:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:44:47,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432846718] [2024-11-08 16:44:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432846718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:47,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:44:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558429218] [2024-11-08 16:44:47,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:47,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:44:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:44:47,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:44:47,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:44:47,656 INFO L87 Difference]: Start difference. First operand 343 states and 449 transitions. Second operand has 15 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:44:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:49,925 INFO L93 Difference]: Finished difference Result 776 states and 1007 transitions. [2024-11-08 16:44:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:44:49,929 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-08 16:44:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:49,932 INFO L225 Difference]: With dead ends: 776 [2024-11-08 16:44:49,932 INFO L226 Difference]: Without dead ends: 436 [2024-11-08 16:44:49,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-11-08 16:44:49,934 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 335 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:49,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 634 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 16:44:49,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-08 16:44:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 398. [2024-11-08 16:44:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 370 states have (on average 1.2675675675675675) internal successors, (469), 372 states have internal predecessors, (469), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:44:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 515 transitions. [2024-11-08 16:44:50,021 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 515 transitions. Word has length 137 [2024-11-08 16:44:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:50,021 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 515 transitions. [2024-11-08 16:44:50,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:44:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 515 transitions. [2024-11-08 16:44:50,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:44:50,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:50,023 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:50,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 16:44:50,023 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:50,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1605876754, now seen corresponding path program 1 times [2024-11-08 16:44:50,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:44:50,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127434287] [2024-11-08 16:44:50,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:50,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:44:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:44:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:44:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:44:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:44:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:44:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:44:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:44:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:44:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:44:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:44:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:44:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:44:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:44:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:44:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:44:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:44:52,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:44:52,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127434287] [2024-11-08 16:44:52,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127434287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:52,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:52,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:44:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282833327] [2024-11-08 16:44:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:52,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:44:52,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:44:52,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:44:52,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:44:52,764 INFO L87 Difference]: Start difference. First operand 398 states and 515 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:44:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:55,333 INFO L93 Difference]: Finished difference Result 844 states and 1090 transitions. [2024-11-08 16:44:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:44:55,334 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2024-11-08 16:44:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:55,336 INFO L225 Difference]: With dead ends: 844 [2024-11-08 16:44:55,336 INFO L226 Difference]: Without dead ends: 449 [2024-11-08 16:44:55,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:44:55,338 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 236 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:55,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 792 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 16:44:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-08 16:44:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 398. [2024-11-08 16:44:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 370 states have (on average 1.2621621621621621) internal successors, (467), 372 states have internal predecessors, (467), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:44:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 513 transitions. [2024-11-08 16:44:55,415 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 513 transitions. Word has length 137 [2024-11-08 16:44:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:55,415 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 513 transitions. [2024-11-08 16:44:55,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:44:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 513 transitions. [2024-11-08 16:44:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:44:55,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:55,417 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:55,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 16:44:55,417 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:55,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:55,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1409226864, now seen corresponding path program 1 times [2024-11-08 16:44:55,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:44:55,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906876910] [2024-11-08 16:44:55,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:55,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:44:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:44:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:44:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:44:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:44:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:44:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:44:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:44:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:44:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:44:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:44:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:44:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:44:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:44:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:44:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:44:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:44:56,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:44:56,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906876910] [2024-11-08 16:44:56,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906876910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:56,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:56,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:44:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83370884] [2024-11-08 16:44:56,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:56,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:44:56,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:44:56,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:44:56,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:44:56,833 INFO L87 Difference]: Start difference. First operand 398 states and 513 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:44:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:58,232 INFO L93 Difference]: Finished difference Result 864 states and 1112 transitions. [2024-11-08 16:44:58,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:44:58,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 16:44:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:58,236 INFO L225 Difference]: With dead ends: 864 [2024-11-08 16:44:58,236 INFO L226 Difference]: Without dead ends: 468 [2024-11-08 16:44:58,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:44:58,238 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 336 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:58,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 683 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:44:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-08 16:44:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 391. [2024-11-08 16:44:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 363 states have (on average 1.2617079889807163) internal successors, (458), 365 states have internal predecessors, (458), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:44:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 504 transitions. [2024-11-08 16:44:58,325 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 504 transitions. Word has length 137 [2024-11-08 16:44:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:58,325 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 504 transitions. [2024-11-08 16:44:58,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:44:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 504 transitions. [2024-11-08 16:44:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:44:58,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:58,328 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:58,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 16:44:58,328 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:58,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1988197868, now seen corresponding path program 1 times [2024-11-08 16:44:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:44:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037225197] [2024-11-08 16:44:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:44:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:45:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:45:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:45:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:45:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:45:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:45:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:45:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:45:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:45:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:45:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:45:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:45:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:45:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:45:00,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:00,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037225197] [2024-11-08 16:45:00,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037225197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:00,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:00,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:45:00,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195765574] [2024-11-08 16:45:00,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:00,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:45:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:45:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:45:00,610 INFO L87 Difference]: Start difference. First operand 391 states and 504 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:45:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:02,660 INFO L93 Difference]: Finished difference Result 806 states and 1037 transitions. [2024-11-08 16:45:02,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:45:02,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2024-11-08 16:45:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:02,663 INFO L225 Difference]: With dead ends: 806 [2024-11-08 16:45:02,663 INFO L226 Difference]: Without dead ends: 418 [2024-11-08 16:45:02,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:45:02,665 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 193 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:02,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 661 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 16:45:02,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-08 16:45:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 387. [2024-11-08 16:45:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 359 states have (on average 1.2590529247910864) internal successors, (452), 361 states have internal predecessors, (452), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:45:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 498 transitions. [2024-11-08 16:45:02,774 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 498 transitions. Word has length 137 [2024-11-08 16:45:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:02,775 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 498 transitions. [2024-11-08 16:45:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:45:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 498 transitions. [2024-11-08 16:45:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:45:02,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:02,777 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:02,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 16:45:02,778 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:02,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1170549418, now seen corresponding path program 1 times [2024-11-08 16:45:02,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:02,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829799903] [2024-11-08 16:45:02,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:02,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:09,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:45:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:09,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:45:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:45:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:45:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:45:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:45:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:10,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:45:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:10,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:10,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:45:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:10,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:45:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:10,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:45:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:10,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:45:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:45:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:10,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:45:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:45:10,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:10,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829799903] [2024-11-08 16:45:10,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829799903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:10,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:10,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 16:45:10,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042334927] [2024-11-08 16:45:10,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:10,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 16:45:10,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:10,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 16:45:10,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:45:10,124 INFO L87 Difference]: Start difference. First operand 387 states and 498 transitions. Second operand has 19 states, 17 states have (on average 3.823529411764706) internal successors, (65), 19 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:45:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:15,706 INFO L93 Difference]: Finished difference Result 872 states and 1116 transitions. [2024-11-08 16:45:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 16:45:15,707 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.823529411764706) internal successors, (65), 19 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-08 16:45:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:15,710 INFO L225 Difference]: With dead ends: 872 [2024-11-08 16:45:15,710 INFO L226 Difference]: Without dead ends: 488 [2024-11-08 16:45:15,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2024-11-08 16:45:15,712 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 606 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:15,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 986 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 16:45:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-08 16:45:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 392. [2024-11-08 16:45:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 364 states have (on average 1.2582417582417582) internal successors, (458), 366 states have internal predecessors, (458), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:45:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 504 transitions. [2024-11-08 16:45:15,789 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 504 transitions. Word has length 137 [2024-11-08 16:45:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:15,790 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 504 transitions. [2024-11-08 16:45:15,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.823529411764706) internal successors, (65), 19 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:45:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 504 transitions. [2024-11-08 16:45:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:45:15,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:15,792 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:15,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 16:45:15,793 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:15,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1871613996, now seen corresponding path program 1 times [2024-11-08 16:45:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743625481] [2024-11-08 16:45:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:45:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:45:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:45:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:45:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:45:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:45:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:45:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:45:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:45:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:45:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:45:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:45:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:45:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:45:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743625481] [2024-11-08 16:45:19,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743625481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:19,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:19,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 16:45:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980667606] [2024-11-08 16:45:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:19,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:45:19,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:45:19,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:45:19,251 INFO L87 Difference]: Start difference. First operand 392 states and 504 transitions. Second operand has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:45:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:21,705 INFO L93 Difference]: Finished difference Result 817 states and 1051 transitions. [2024-11-08 16:45:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:45:21,706 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2024-11-08 16:45:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:21,709 INFO L225 Difference]: With dead ends: 817 [2024-11-08 16:45:21,709 INFO L226 Difference]: Without dead ends: 428 [2024-11-08 16:45:21,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2024-11-08 16:45:21,711 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 193 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:21,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 946 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 16:45:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-08 16:45:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 388. [2024-11-08 16:45:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 360 states have (on average 1.2583333333333333) internal successors, (453), 362 states have internal predecessors, (453), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:45:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 499 transitions. [2024-11-08 16:45:21,801 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 499 transitions. Word has length 137 [2024-11-08 16:45:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:21,802 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 499 transitions. [2024-11-08 16:45:21,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:45:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 499 transitions. [2024-11-08 16:45:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:45:21,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:21,804 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:21,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 16:45:21,804 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:21,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:21,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1381493031, now seen corresponding path program 1 times [2024-11-08 16:45:21,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:21,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214141630] [2024-11-08 16:45:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:21,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:45:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:45:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:45:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:45:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:45:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:45:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:45:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:45:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:45:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:45:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:45:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:45:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:45:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:45:25,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214141630] [2024-11-08 16:45:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214141630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 16:45:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573995684] [2024-11-08 16:45:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:25,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:45:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:45:25,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:45:25,259 INFO L87 Difference]: Start difference. First operand 388 states and 499 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:45:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:28,097 INFO L93 Difference]: Finished difference Result 843 states and 1083 transitions. [2024-11-08 16:45:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:45:28,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2024-11-08 16:45:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:28,101 INFO L225 Difference]: With dead ends: 843 [2024-11-08 16:45:28,101 INFO L226 Difference]: Without dead ends: 458 [2024-11-08 16:45:28,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:45:28,103 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 240 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:28,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 897 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:45:28,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-08 16:45:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 394. [2024-11-08 16:45:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 366 states have (on average 1.2595628415300546) internal successors, (461), 368 states have internal predecessors, (461), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:45:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 507 transitions. [2024-11-08 16:45:28,206 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 507 transitions. Word has length 137 [2024-11-08 16:45:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:28,207 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 507 transitions. [2024-11-08 16:45:28,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:45:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 507 transitions. [2024-11-08 16:45:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:45:28,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:28,209 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:28,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 16:45:28,210 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:28,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1795363020, now seen corresponding path program 1 times [2024-11-08 16:45:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:28,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424161112] [2024-11-08 16:45:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:31,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:31,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:45:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:45:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:45:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:45:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:31,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:45:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:45:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:32,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:45:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:32,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:45:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:32,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:45:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:32,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:45:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:32,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:45:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:32,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:45:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:45:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:45:32,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:32,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424161112] [2024-11-08 16:45:32,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424161112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:32,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 16:45:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195194842] [2024-11-08 16:45:32,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:32,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 16:45:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:32,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 16:45:32,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:45:32,106 INFO L87 Difference]: Start difference. First operand 394 states and 507 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:45:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:34,915 INFO L93 Difference]: Finished difference Result 849 states and 1091 transitions. [2024-11-08 16:45:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:45:34,916 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2024-11-08 16:45:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:34,919 INFO L225 Difference]: With dead ends: 849 [2024-11-08 16:45:34,919 INFO L226 Difference]: Without dead ends: 458 [2024-11-08 16:45:34,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2024-11-08 16:45:34,920 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 423 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:34,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 923 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 16:45:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-08 16:45:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 406. [2024-11-08 16:45:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 378 states have (on average 1.2566137566137565) internal successors, (475), 380 states have internal predecessors, (475), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:45:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 521 transitions. [2024-11-08 16:45:35,023 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 521 transitions. Word has length 137 [2024-11-08 16:45:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:35,024 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 521 transitions. [2024-11-08 16:45:35,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:45:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 521 transitions. [2024-11-08 16:45:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:45:35,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:35,026 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:35,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-08 16:45:35,026 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:35,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:35,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1798539698, now seen corresponding path program 1 times [2024-11-08 16:45:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:35,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971651] [2024-11-08 16:45:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:35,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:45:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:45:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:45:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:45:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:45:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:45:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:45:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:45:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:45:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:45:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:45:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:45:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:45:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:45:39,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971651] [2024-11-08 16:45:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:39,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:39,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:45:39,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541224663] [2024-11-08 16:45:39,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:39,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:45:39,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:39,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:45:39,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:45:39,648 INFO L87 Difference]: Start difference. First operand 406 states and 521 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:45:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:41,493 INFO L93 Difference]: Finished difference Result 879 states and 1126 transitions. [2024-11-08 16:45:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:45:41,495 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-08 16:45:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:41,498 INFO L225 Difference]: With dead ends: 879 [2024-11-08 16:45:41,498 INFO L226 Difference]: Without dead ends: 476 [2024-11-08 16:45:41,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:45:41,500 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 318 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:41,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 547 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 16:45:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-08 16:45:41,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 408. [2024-11-08 16:45:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 380 states have (on average 1.2578947368421052) internal successors, (478), 382 states have internal predecessors, (478), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:45:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 524 transitions. [2024-11-08 16:45:41,586 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 524 transitions. Word has length 137 [2024-11-08 16:45:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:41,586 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 524 transitions. [2024-11-08 16:45:41,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:45:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 524 transitions. [2024-11-08 16:45:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:45:41,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:41,588 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:41,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 16:45:41,589 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:41,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1394933141, now seen corresponding path program 1 times [2024-11-08 16:45:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:41,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767846623] [2024-11-08 16:45:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:41,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:45:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:45:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:45:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:45:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:45:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:45:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:45:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:45:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:45:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:45:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:45:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:45:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:45:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:45:46,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:46,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767846623] [2024-11-08 16:45:46,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767846623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:46,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:46,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:45:46,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141355924] [2024-11-08 16:45:46,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:46,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:45:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:46,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:45:46,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:45:46,243 INFO L87 Difference]: Start difference. First operand 408 states and 524 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:45:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:55,961 INFO L93 Difference]: Finished difference Result 861 states and 1104 transitions. [2024-11-08 16:45:55,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:45:55,963 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2024-11-08 16:45:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:55,965 INFO L225 Difference]: With dead ends: 861 [2024-11-08 16:45:55,966 INFO L226 Difference]: Without dead ends: 456 [2024-11-08 16:45:55,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:45:55,967 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 361 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:55,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 716 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-08 16:45:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-08 16:45:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 401. [2024-11-08 16:45:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 373 states have (on average 1.2493297587131367) internal successors, (466), 375 states have internal predecessors, (466), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:45:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 512 transitions. [2024-11-08 16:45:56,074 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 512 transitions. Word has length 137 [2024-11-08 16:45:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:56,075 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 512 transitions. [2024-11-08 16:45:56,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:45:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 512 transitions. [2024-11-08 16:45:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:45:56,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:56,077 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:56,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 16:45:56,078 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:56,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1890966121, now seen corresponding path program 1 times [2024-11-08 16:45:56,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:56,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513803765] [2024-11-08 16:45:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:56,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:45:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:45:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:45:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:45:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:45:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:45:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:45:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:45:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:45:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:45:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:45:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:45:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:45:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:45:57,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:57,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513803765] [2024-11-08 16:45:57,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513803765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:57,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:57,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:45:57,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357953598] [2024-11-08 16:45:57,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:57,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:45:57,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:57,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:45:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:45:57,177 INFO L87 Difference]: Start difference. First operand 401 states and 512 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:45:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:58,526 INFO L93 Difference]: Finished difference Result 873 states and 1111 transitions. [2024-11-08 16:45:58,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:45:58,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 16:45:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:58,528 INFO L225 Difference]: With dead ends: 873 [2024-11-08 16:45:58,529 INFO L226 Difference]: Without dead ends: 475 [2024-11-08 16:45:58,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:45:58,530 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 149 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:58,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1054 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:45:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-08 16:45:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 401. [2024-11-08 16:45:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 373 states have (on average 1.2493297587131367) internal successors, (466), 375 states have internal predecessors, (466), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:45:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 512 transitions. [2024-11-08 16:45:58,635 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 512 transitions. Word has length 137 [2024-11-08 16:45:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:58,635 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 512 transitions. [2024-11-08 16:45:58,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:45:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 512 transitions. [2024-11-08 16:45:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:45:58,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:58,638 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:45:58,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 16:45:58,638 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:58,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1124137497, now seen corresponding path program 1 times [2024-11-08 16:45:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:58,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790773533] [2024-11-08 16:45:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:58,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:46:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:46:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:46:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:46:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:46:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:46:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:46:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:46:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:46:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:46:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:46:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:46:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:46:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:46:03,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:03,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790773533] [2024-11-08 16:46:03,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790773533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:03,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:03,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 16:46:03,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395660000] [2024-11-08 16:46:03,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:03,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:46:03,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:03,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:46:03,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:46:03,147 INFO L87 Difference]: Start difference. First operand 401 states and 512 transitions. Second operand has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-08 16:46:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:06,087 INFO L93 Difference]: Finished difference Result 869 states and 1107 transitions. [2024-11-08 16:46:06,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:46:06,088 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 137 [2024-11-08 16:46:06,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:06,090 INFO L225 Difference]: With dead ends: 869 [2024-11-08 16:46:06,090 INFO L226 Difference]: Without dead ends: 471 [2024-11-08 16:46:06,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:46:06,091 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 316 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:06,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 964 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 16:46:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-08 16:46:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 401. [2024-11-08 16:46:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 373 states have (on average 1.2466487935656836) internal successors, (465), 375 states have internal predecessors, (465), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:46:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 511 transitions. [2024-11-08 16:46:06,174 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 511 transitions. Word has length 137 [2024-11-08 16:46:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:06,175 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 511 transitions. [2024-11-08 16:46:06,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-08 16:46:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 511 transitions. [2024-11-08 16:46:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:46:06,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:06,177 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:06,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 16:46:06,178 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:06,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2103538380, now seen corresponding path program 1 times [2024-11-08 16:46:06,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:06,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498277219] [2024-11-08 16:46:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:46:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:46:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:46:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:46:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:46:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:46:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:46:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:46:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:46:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:46:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:46:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:46:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:46:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:46:12,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498277219] [2024-11-08 16:46:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498277219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:12,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:12,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 16:46:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583301621] [2024-11-08 16:46:12,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:12,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 16:46:12,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:12,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 16:46:12,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:46:12,843 INFO L87 Difference]: Start difference. First operand 401 states and 511 transitions. Second operand has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-08 16:46:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:16,525 INFO L93 Difference]: Finished difference Result 881 states and 1117 transitions. [2024-11-08 16:46:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:46:16,526 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) Word has length 137 [2024-11-08 16:46:16,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:16,529 INFO L225 Difference]: With dead ends: 881 [2024-11-08 16:46:16,529 INFO L226 Difference]: Without dead ends: 483 [2024-11-08 16:46:16,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:46:16,531 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 498 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:16,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 959 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 16:46:16,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-08 16:46:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 413. [2024-11-08 16:46:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 385 states have (on average 1.2415584415584415) internal successors, (478), 387 states have internal predecessors, (478), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:46:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 524 transitions. [2024-11-08 16:46:16,632 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 524 transitions. Word has length 137 [2024-11-08 16:46:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:16,633 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 524 transitions. [2024-11-08 16:46:16,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-08 16:46:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 524 transitions. [2024-11-08 16:46:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:46:16,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:16,635 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:16,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-08 16:46:16,635 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1490364338, now seen corresponding path program 1 times [2024-11-08 16:46:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:16,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201570488] [2024-11-08 16:46:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:46:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:46:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:46:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:46:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:46:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:46:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:46:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:46:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:46:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:46:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:46:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:46:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:46:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:46:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201570488] [2024-11-08 16:46:21,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201570488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:21,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:21,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 16:46:21,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613714110] [2024-11-08 16:46:21,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:21,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:46:21,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:21,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:46:21,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:46:21,363 INFO L87 Difference]: Start difference. First operand 413 states and 524 transitions. Second operand has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:46:25,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:25,341 INFO L93 Difference]: Finished difference Result 871 states and 1103 transitions. [2024-11-08 16:46:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:46:25,341 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2024-11-08 16:46:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:25,344 INFO L225 Difference]: With dead ends: 871 [2024-11-08 16:46:25,344 INFO L226 Difference]: Without dead ends: 461 [2024-11-08 16:46:25,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2024-11-08 16:46:25,345 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 242 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:25,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1330 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 16:46:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-08 16:46:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 409. [2024-11-08 16:46:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 381 states have (on average 1.2414698162729658) internal successors, (473), 383 states have internal predecessors, (473), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:46:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 519 transitions. [2024-11-08 16:46:25,436 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 519 transitions. Word has length 137 [2024-11-08 16:46:25,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:25,436 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 519 transitions. [2024-11-08 16:46:25,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:46:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 519 transitions. [2024-11-08 16:46:25,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:46:25,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:25,437 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:25,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 16:46:25,438 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:25,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1586352725, now seen corresponding path program 1 times [2024-11-08 16:46:25,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:25,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095155228] [2024-11-08 16:46:25,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:25,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:46:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:46:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:46:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:46:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:46:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:46:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:46:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:46:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:46:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:46:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:46:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:46:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:46:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:46:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095155228] [2024-11-08 16:46:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095155228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:27,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:27,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:46:27,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263192419] [2024-11-08 16:46:27,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:27,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:46:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:27,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:46:27,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:46:27,458 INFO L87 Difference]: Start difference. First operand 409 states and 519 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:46:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:28,523 INFO L93 Difference]: Finished difference Result 822 states and 1042 transitions. [2024-11-08 16:46:28,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:46:28,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2024-11-08 16:46:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:28,526 INFO L225 Difference]: With dead ends: 822 [2024-11-08 16:46:28,526 INFO L226 Difference]: Without dead ends: 416 [2024-11-08 16:46:28,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:46:28,527 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 376 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:28,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 420 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:46:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-08 16:46:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 395. [2024-11-08 16:46:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 367 states have (on average 1.237057220708447) internal successors, (454), 369 states have internal predecessors, (454), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 16:46:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 500 transitions. [2024-11-08 16:46:28,609 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 500 transitions. Word has length 137 [2024-11-08 16:46:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:28,610 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 500 transitions. [2024-11-08 16:46:28,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-08 16:46:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 500 transitions. [2024-11-08 16:46:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:46:28,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:28,612 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:28,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-08 16:46:28,612 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1285889930, now seen corresponding path program 1 times [2024-11-08 16:46:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:28,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749858629] [2024-11-08 16:46:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:46:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:46:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:46:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:46:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:46:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:46:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:46:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:46:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:46:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:46:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:46:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:46:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:46:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:46:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749858629] [2024-11-08 16:46:33,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749858629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:33,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:33,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:46:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317087704] [2024-11-08 16:46:33,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:33,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:46:33,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:33,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:46:33,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:46:33,917 INFO L87 Difference]: Start difference. First operand 395 states and 500 transitions. Second operand has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-08 16:46:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:36,473 INFO L93 Difference]: Finished difference Result 855 states and 1078 transitions. [2024-11-08 16:46:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:46:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 137 [2024-11-08 16:46:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:36,477 INFO L225 Difference]: With dead ends: 855 [2024-11-08 16:46:36,477 INFO L226 Difference]: Without dead ends: 463 [2024-11-08 16:46:36,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:46:36,479 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 241 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:36,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 505 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 16:46:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-08 16:46:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 377. [2024-11-08 16:46:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 352 states have (on average 1.2301136363636365) internal successors, (433), 353 states have internal predecessors, (433), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 16:46:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 473 transitions. [2024-11-08 16:46:36,586 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 473 transitions. Word has length 137 [2024-11-08 16:46:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:36,587 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 473 transitions. [2024-11-08 16:46:36,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-08 16:46:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 473 transitions. [2024-11-08 16:46:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:46:36,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:36,589 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:36,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 16:46:36,590 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:36,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1986954508, now seen corresponding path program 1 times [2024-11-08 16:46:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844545365] [2024-11-08 16:46:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:46:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:46:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:46:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:46:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:46:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:46:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:46:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:46:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:46:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:46:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:46:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:46:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:46:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:46:43,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:43,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844545365] [2024-11-08 16:46:43,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844545365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:43,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:43,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 16:46:43,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960068908] [2024-11-08 16:46:43,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:43,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:46:43,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:43,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:46:43,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:46:43,412 INFO L87 Difference]: Start difference. First operand 377 states and 473 transitions. Second operand has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:46:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:47,817 INFO L93 Difference]: Finished difference Result 793 states and 995 transitions. [2024-11-08 16:46:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:46:47,817 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-08 16:46:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:47,819 INFO L225 Difference]: With dead ends: 793 [2024-11-08 16:46:47,819 INFO L226 Difference]: Without dead ends: 419 [2024-11-08 16:46:47,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2024-11-08 16:46:47,821 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 156 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:47,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1122 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 16:46:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-08 16:46:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 363. [2024-11-08 16:46:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 338 states have (on average 1.2366863905325445) internal successors, (418), 339 states have internal predecessors, (418), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 16:46:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 458 transitions. [2024-11-08 16:46:47,884 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 458 transitions. Word has length 137 [2024-11-08 16:46:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:47,884 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 458 transitions. [2024-11-08 16:46:47,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:46:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 458 transitions. [2024-11-08 16:46:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 16:46:47,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:47,886 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:47,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-08 16:46:47,886 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:47,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:47,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2069631684, now seen corresponding path program 1 times [2024-11-08 16:46:47,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:47,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756291805] [2024-11-08 16:46:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:47,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:52,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:52,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:46:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:52,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:46:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:46:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:52,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:46:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:52,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:46:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:46:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 16:46:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:52,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:52,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:46:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:53,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:46:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:53,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:46:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:53,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:46:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:53,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:46:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:53,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:46:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:46:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756291805] [2024-11-08 16:46:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756291805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:53,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:53,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 16:46:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182954871] [2024-11-08 16:46:53,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:53,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:46:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:46:53,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:46:53,065 INFO L87 Difference]: Start difference. First operand 363 states and 458 transitions. Second operand has 16 states, 14 states have (on average 4.785714285714286) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:46:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:55,538 INFO L93 Difference]: Finished difference Result 725 states and 914 transitions. [2024-11-08 16:46:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:46:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.785714285714286) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 139 [2024-11-08 16:46:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:55,541 INFO L225 Difference]: With dead ends: 725 [2024-11-08 16:46:55,541 INFO L226 Difference]: Without dead ends: 365 [2024-11-08 16:46:55,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:46:55,542 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 251 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:55,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 546 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 16:46:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-08 16:46:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 363. [2024-11-08 16:46:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 338 states have (on average 1.2337278106508875) internal successors, (417), 339 states have internal predecessors, (417), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 16:46:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 457 transitions. [2024-11-08 16:46:55,610 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 457 transitions. Word has length 139 [2024-11-08 16:46:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:55,611 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 457 transitions. [2024-11-08 16:46:55,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.785714285714286) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 16:46:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 457 transitions. [2024-11-08 16:46:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 16:46:55,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:55,612 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:46:55,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-08 16:46:55,613 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:55,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1545277242, now seen corresponding path program 1 times [2024-11-08 16:46:55,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:55,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812191906] [2024-11-08 16:46:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:46:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218492980] [2024-11-08 16:46:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:55,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:55,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:46:55,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:46:55,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:46:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:46:56,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:46:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:46:57,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:46:57,910 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:46:57,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:46:57,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:46:58,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:58,117 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:46:58,313 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:46:58,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:46:58 BoogieIcfgContainer [2024-11-08 16:46:58,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:46:58,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:46:58,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:46:58,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:46:58,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:41:42" (3/4) ... [2024-11-08 16:46:58,321 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:46:58,323 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:46:58,323 INFO L158 Benchmark]: Toolchain (without parser) took 318321.01ms. Allocated memory was 148.9MB in the beginning and 1.0GB in the end (delta: 899.7MB). Free memory was 110.2MB in the beginning and 458.8MB in the end (delta: -348.6MB). Peak memory consumption was 551.9MB. Max. memory is 16.1GB. [2024-11-08 16:46:58,323 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 113.2MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:46:58,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.32ms. Allocated memory is still 148.9MB. Free memory was 109.9MB in the beginning and 104.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 16:46:58,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.94ms. Allocated memory is still 148.9MB. Free memory was 104.6MB in the beginning and 99.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:46:58,324 INFO L158 Benchmark]: Boogie Preprocessor took 85.91ms. Allocated memory is still 148.9MB. Free memory was 99.9MB in the beginning and 96.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:46:58,324 INFO L158 Benchmark]: RCFGBuilder took 1301.21ms. Allocated memory is still 148.9MB. Free memory was 96.3MB in the beginning and 57.0MB in the end (delta: 39.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 16:46:58,325 INFO L158 Benchmark]: TraceAbstraction took 316199.93ms. Allocated memory was 148.9MB in the beginning and 1.0GB in the end (delta: 899.7MB). Free memory was 56.4MB in the beginning and 458.8MB in the end (delta: -402.3MB). Peak memory consumption was 499.0MB. Max. memory is 16.1GB. [2024-11-08 16:46:58,325 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 1.0GB. Free memory is still 458.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:46:58,327 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.37ms. Allocated memory is still 113.2MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.32ms. Allocated memory is still 148.9MB. Free memory was 109.9MB in the beginning and 104.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.94ms. Allocated memory is still 148.9MB. Free memory was 104.6MB in the beginning and 99.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.91ms. Allocated memory is still 148.9MB. Free memory was 99.9MB in the beginning and 96.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1301.21ms. Allocated memory is still 148.9MB. Free memory was 96.3MB in the beginning and 57.0MB in the end (delta: 39.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 316199.93ms. Allocated memory was 148.9MB in the beginning and 1.0GB in the end (delta: 899.7MB). Free memory was 56.4MB in the beginning and 458.8MB in the end (delta: -402.3MB). Peak memory consumption was 499.0MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 1.0GB. Free memory is still 458.8MB. 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 122. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 5, -25, 4, 4, 4, 8, 10, 99.6, 127.5, 16.5, 256.5, 4288034294, 0 }; [L53] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L54] signed short int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L55] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L56] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L57] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L58] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L59] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L60] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L61] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L62] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L63] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L64] unsigned long int* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L65] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L66] unsigned long int last_1_WrapperStruct00_var_1_12 = 10; [L67] unsigned char last_1_WrapperStruct00_var_1_18 = 0; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=0, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_12 [L118] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_18 [L119] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L129] RET updateLastVariables() [L130] CALL updateVariables() [L93] WrapperStruct00.var_1_3 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -32768) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -32768) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L95] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L96] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_3 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_3 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L97] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L99] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L100] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L102] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L103] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_13 [L104] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_13 [L104] EXPR WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L104] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L106] EXPR WrapperStruct00.var_1_14 [L106] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_14 [L106] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L106] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L107] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L108] EXPR WrapperStruct00.var_1_15 [L108] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_15 [L108] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L108] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L111] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L113] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ulong() [L114] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L115] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L130] RET updateVariables() [L131] CALL step() [L71] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L71] unsigned long int stepLocal_2 = last_1_WrapperStruct00_var_1_12 / (*(WrapperStruct00_var_1_3_Pointer)); [L72] COND TRUE stepLocal_2 != (last_1_WrapperStruct00_var_1_18 - 64) [L73] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L73] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L73] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L73] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L73] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L73] (*(WrapperStruct00_var_1_8_Pointer)) = (((((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))) [L77] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L77] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L77] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L77] COND FALSE !((- ((*(WrapperStruct00_var_1_13_Pointer)) / 0.6f)) > (((*(WrapperStruct00_var_1_14_Pointer)) + 3.25f) / (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) [L80] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L82] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L83] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L83] (*(WrapperStruct00_var_1_7_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L84] signed long int stepLocal_1 = - (*(WrapperStruct00_var_1_3_Pointer)); [L85] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L85] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_7_Pointer)) / (*(WrapperStruct00_var_1_3_Pointer)); [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0, stepLocal_0=-8, stepLocal_1=1] [L86] COND FALSE !(stepLocal_0 >= (*(WrapperStruct00_var_1_7_Pointer))) [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR (((*(WrapperStruct00_var_1_7_Pointer)) / (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? (((- (*(WrapperStruct00_var_1_3_Pointer))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR ((((*(WrapperStruct00_var_1_7_Pointer)) / (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? (((- (*(WrapperStruct00_var_1_3_Pointer))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) : 1) && ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_18_Pointer)))) [L122] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L122] EXPR ((((*(WrapperStruct00_var_1_7_Pointer)) / (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? (((- (*(WrapperStruct00_var_1_3_Pointer))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) : 1) && ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR (((((*(WrapperStruct00_var_1_7_Pointer)) / (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? (((- (*(WrapperStruct00_var_1_3_Pointer))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) : 1) && ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_18_Pointer))))) && (((last_1_WrapperStruct00_var_1_12 / (*(WrapperStruct00_var_1_3_Pointer))) != (last_1_WrapperStruct00_var_1_18 - 64)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) [L122] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR ((last_1_WrapperStruct00_var_1_12 / (*(WrapperStruct00_var_1_3_Pointer))) != (last_1_WrapperStruct00_var_1_18 - 64)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) [L122] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L122] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L122] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR ((last_1_WrapperStruct00_var_1_12 / (*(WrapperStruct00_var_1_3_Pointer))) != (last_1_WrapperStruct00_var_1_18 - 64)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR (((((*(WrapperStruct00_var_1_7_Pointer)) / (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? (((- (*(WrapperStruct00_var_1_3_Pointer))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) : 1) && ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_18_Pointer))))) && (((last_1_WrapperStruct00_var_1_12 / (*(WrapperStruct00_var_1_3_Pointer))) != (last_1_WrapperStruct00_var_1_18 - 64)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR ((((((*(WrapperStruct00_var_1_7_Pointer)) / (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? (((- (*(WrapperStruct00_var_1_3_Pointer))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) : 1) && ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_18_Pointer))))) && (((last_1_WrapperStruct00_var_1_12 / (*(WrapperStruct00_var_1_3_Pointer))) != (last_1_WrapperStruct00_var_1_18 - 64)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))))) && (((- ((*(WrapperStruct00_var_1_13_Pointer)) / 0.6f)) > (((*(WrapperStruct00_var_1_14_Pointer)) + 3.25f) / (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer)))))) [L122] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))) [L122] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L122] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR ((- ((*(WrapperStruct00_var_1_13_Pointer)) / 0.6f)) > (((*(WrapperStruct00_var_1_14_Pointer)) + 3.25f) / (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) [L122] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L122] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L122] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR ((- ((*(WrapperStruct00_var_1_13_Pointer)) / 0.6f)) > (((*(WrapperStruct00_var_1_14_Pointer)) + 3.25f) / (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR ((((((*(WrapperStruct00_var_1_7_Pointer)) / (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? (((- (*(WrapperStruct00_var_1_3_Pointer))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) : 1) && ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_18_Pointer))))) && (((last_1_WrapperStruct00_var_1_12 / (*(WrapperStruct00_var_1_3_Pointer))) != (last_1_WrapperStruct00_var_1_18 - 64)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))))) && (((- ((*(WrapperStruct00_var_1_13_Pointer)) / 0.6f)) > (((*(WrapperStruct00_var_1_14_Pointer)) + 3.25f) / (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122] EXPR (((((((*(WrapperStruct00_var_1_7_Pointer)) / (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? (((- (*(WrapperStruct00_var_1_3_Pointer))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) : 1) && ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_18_Pointer))))) && (((last_1_WrapperStruct00_var_1_12 / (*(WrapperStruct00_var_1_3_Pointer))) != (last_1_WrapperStruct00_var_1_18 - 64)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))))) && (((- ((*(WrapperStruct00_var_1_13_Pointer)) / 0.6f)) > (((*(WrapperStruct00_var_1_14_Pointer)) + 3.25f) / (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L122-L123] return (((((((*(WrapperStruct00_var_1_7_Pointer)) / (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_7_Pointer))) ? (((- (*(WrapperStruct00_var_1_3_Pointer))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) : 1) && ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_18_Pointer))))) && (((last_1_WrapperStruct00_var_1_12 / (*(WrapperStruct00_var_1_3_Pointer))) != (last_1_WrapperStruct00_var_1_18 - 64)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_10_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))))) && (((- ((*(WrapperStruct00_var_1_13_Pointer)) / 0.6f)) > (((*(WrapperStruct00_var_1_14_Pointer)) + 3.25f) / (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_10_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer)))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_11_Pointer={4:8}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_12=10, last_1_WrapperStruct00_var_1_18=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 315.9s, OverallIterations: 47, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 130.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13883 SdHoareTripleChecker+Valid, 91.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13844 mSDsluCounter, 32073 SdHoareTripleChecker+Invalid, 85.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26636 mSDsCounter, 1104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35143 IncrementalHoareTripleChecker+Invalid, 36247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1104 mSolverCounterUnsat, 5437 mSDtfsCounter, 35143 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2502 GetRequests, 1720 SyntacticMatches, 11 SemanticMatches, 771 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2874 ImplicationChecksByTransitivity, 60.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=41, InterpolantAutomatonStates: 472, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 46 MinimizatonAttempts, 1935 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 7.6s SatisfiabilityAnalysisTime, 170.1s InterpolantComputationTime, 6496 NumberOfCodeBlocks, 6496 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 6172 ConstructedInterpolants, 0 QuantifiedInterpolants, 143296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 19320/19320 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-08 16:46:58,542 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-08 16:46:58,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX --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 4714a0c6536056117a4ee0063fda0c81448928e693130365c60e5088462281df --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:47:01,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:47:01,255 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:47:01,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:47:01,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:47:01,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:47:01,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:47:01,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:47:01,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:47:01,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:47:01,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:47:01,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:47:01,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:47:01,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:47:01,321 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:47:01,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:47:01,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:47:01,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:47:01,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:47:01,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:47:01,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:47:01,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:47:01,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:47:01,332 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:47:01,333 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:47:01,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:47:01,333 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:47:01,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:47:01,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:47:01,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:47:01,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:47:01,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:47:01,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:47:01,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:47:01,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:47:01,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:47:01,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:47:01,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:47:01,342 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:47:01,343 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:47:01,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:47:01,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:47:01,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:47:01,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:47:01,359 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX 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 -> 4714a0c6536056117a4ee0063fda0c81448928e693130365c60e5088462281df [2024-11-08 16:47:01,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:47:01,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:47:01,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:47:01,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:47:01,854 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:47:01,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i Unable to find full path for "g++" [2024-11-08 16:47:04,078 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:47:04,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:47:04,295 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i [2024-11-08 16:47:04,305 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/data/b3deda27d/35804b13b76f4ab99064a58b482dec13/FLAGffc11fbf3 [2024-11-08 16:47:04,322 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/data/b3deda27d/35804b13b76f4ab99064a58b482dec13 [2024-11-08 16:47:04,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:47:04,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:47:04,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:47:04,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:47:04,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:47:04,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:04,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2776b847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04, skipping insertion in model container [2024-11-08 16:47:04,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:04,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:47:04,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i[916,929] [2024-11-08 16:47:04,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:47:04,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:47:04,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i[916,929] [2024-11-08 16:47:04,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:47:04,957 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:47:04,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04 WrapperNode [2024-11-08 16:47:04,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:47:04,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:47:04,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:47:04,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:47:04,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,073 INFO L138 Inliner]: procedures = 37, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-08 16:47:05,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:47:05,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:47:05,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:47:05,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:47:05,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,140 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-08 16:47:05,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:47:05,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:47:05,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:47:05,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:47:05,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (1/1) ... [2024-11-08 16:47:05,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:47:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:47:05,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:47:05,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:47:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:47:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:47:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:47:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:47:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:47:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 16:47:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 16:47:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:47:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:47:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 16:47:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 16:47:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 16:47:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 16:47:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 16:47:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 16:47:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 16:47:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 16:47:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 16:47:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 16:47:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:47:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:47:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-08 16:47:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-08 16:47:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:47:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:47:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:47:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:47:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 16:47:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 16:47:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:47:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:47:05,613 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:47:05,616 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:47:21,380 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-08 16:47:21,380 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:47:21,400 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:47:21,400 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:47:21,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:21 BoogieIcfgContainer [2024-11-08 16:47:21,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:47:21,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:47:21,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:47:21,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:47:21,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:47:04" (1/3) ... [2024-11-08 16:47:21,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23943dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:47:21, skipping insertion in model container [2024-11-08 16:47:21,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:47:04" (2/3) ... [2024-11-08 16:47:21,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23943dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:47:21, skipping insertion in model container [2024-11-08 16:47:21,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:47:21" (3/3) ... [2024-11-08 16:47:21,414 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-4.i [2024-11-08 16:47:21,442 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:47:21,443 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:47:21,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:47:21,530 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;@6dbbf8d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:47:21,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:47:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:47:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:47:21,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:47:21,552 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:47:21,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:47:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:47:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1170486752, now seen corresponding path program 1 times [2024-11-08 16:47:21,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:47:21,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491704586] [2024-11-08 16:47:21,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:21,582 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-08 16:47:21,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:47:21,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:47:21,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:47:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:22,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:47:22,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:47:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-08 16:47:22,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:47:22,559 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:47:22,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491704586] [2024-11-08 16:47:22,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491704586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:47:22,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:47:22,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:47:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008913446] [2024-11-08 16:47:22,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:47:22,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:47:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:47:22,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:47:22,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:47:22,617 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:47:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:47:22,670 INFO L93 Difference]: Finished difference Result 213 states and 331 transitions. [2024-11-08 16:47:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:47:22,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-08 16:47:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:47:22,687 INFO L225 Difference]: With dead ends: 213 [2024-11-08 16:47:22,687 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 16:47:22,695 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-08 16:47:22,703 INFO L432 NwaCegarLoop]: 154 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, 154 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-08 16:47:22,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:47:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 16:47:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-08 16:47:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:47:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-08 16:47:22,778 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2024-11-08 16:47:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:47:22,780 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-08 16:47:22,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 16:47:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-08 16:47:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:47:22,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:47:22,787 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:47:22,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:47:22,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:47:22,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:47:22,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:47:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1675110542, now seen corresponding path program 1 times [2024-11-08 16:47:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:47:22,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298475241] [2024-11-08 16:47:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:22,990 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-08 16:47:22,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:47:23,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:47:23,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:47:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:23,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:47:23,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:47:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:47:24,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:47:24,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:47:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298475241] [2024-11-08 16:47:24,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298475241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:47:24,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:47:24,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:47:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364542817] [2024-11-08 16:47:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:47:24,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:47:24,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:47:24,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:47:24,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:47:24,154 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:47:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:47:24,366 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2024-11-08 16:47:24,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:47:24,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 16:47:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:47:24,371 INFO L225 Difference]: With dead ends: 214 [2024-11-08 16:47:24,373 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 16:47:24,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:47:24,377 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:47:24,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 583 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:47:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 16:47:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 16:47:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 16:47:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-08 16:47:24,409 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 130 [2024-11-08 16:47:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:47:24,412 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-08 16:47:24,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:47:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-08 16:47:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:47:24,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:47:24,420 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:47:24,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 16:47:24,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:47:24,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:47:24,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:47:24,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1673263500, now seen corresponding path program 1 times [2024-11-08 16:47:24,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:47:24,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422756955] [2024-11-08 16:47:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:24,626 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-08 16:47:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:47:24,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:47:24,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:47:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:25,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 16:47:25,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:47:25,783 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 48 treesize of output 47 [2024-11-08 16:47:27,049 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 107 treesize of output 75 [2024-11-08 16:47:29,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 16:47:30,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 16:47:31,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 16:47:31,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 16:47:32,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 16:47:33,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 16:47:34,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 16:47:35,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-08 16:47:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 96 proven. 134 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 16:47:36,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:47:41,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:47:41,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422756955] [2024-11-08 16:47:41,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422756955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:47:41,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849791147] [2024-11-08 16:47:41,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:47:41,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:47:41,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:47:41,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:47:41,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 16:47:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:47:41,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:47:41,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:47:41,759 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 77 treesize of output 76 [2024-11-08 16:47:42,643 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 120 treesize of output 106 [2024-11-08 16:47:44,717 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 11 treesize of output 7 [2024-11-08 16:47:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:47:45,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:47:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849791147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:47:45,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:47:45,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2024-11-08 16:47:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157499476] [2024-11-08 16:47:45,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:47:45,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:47:45,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:47:45,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:47:45,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=205, Unknown=1, NotChecked=0, Total=272 [2024-11-08 16:47:45,388 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:47:53,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:47:56,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:47:59,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:48:03,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:48:08,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:48:12,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:48:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:48:12,532 INFO L93 Difference]: Finished difference Result 321 states and 463 transitions. [2024-11-08 16:48:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:48:12,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 16:48:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:48:12,585 INFO L225 Difference]: With dead ends: 321 [2024-11-08 16:48:12,585 INFO L226 Difference]: Without dead ends: 214 [2024-11-08 16:48:12,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=79, Invalid=262, Unknown=1, NotChecked=0, Total=342 [2024-11-08 16:48:12,592 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 84 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:48:12,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 488 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 26.4s Time] [2024-11-08 16:48:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-08 16:48:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 191. [2024-11-08 16:48:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 158 states have (on average 1.3734177215189873) internal successors, (217), 158 states have internal predecessors, (217), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 16:48:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 277 transitions. [2024-11-08 16:48:12,666 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 277 transitions. Word has length 130 [2024-11-08 16:48:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:48:12,667 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 277 transitions. [2024-11-08 16:48:12,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:48:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 277 transitions. [2024-11-08 16:48:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:48:12,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:48:12,673 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:48:12,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:48:12,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 16:48:13,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:48:13,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:48:13,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:48:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1266633725, now seen corresponding path program 1 times [2024-11-08 16:48:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:48:13,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903015399] [2024-11-08 16:48:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:48:13,075 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-08 16:48:13,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:48:13,078 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:48:13,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:48:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:48:14,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:48:14,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:48:17,304 INFO L349 Elim1Store]: treesize reduction 48, result has 27.3 percent of original size [2024-11-08 16:48:17,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 60 [2024-11-08 16:48:17,321 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:48:17,322 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2024-11-08 16:48:17,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2024-11-08 16:48:17,559 INFO L349 Elim1Store]: treesize reduction 35, result has 28.6 percent of original size [2024-11-08 16:48:17,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 22 treesize of output 36 [2024-11-08 16:48:21,870 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~WrapperStruct00_var_1_18_Pointer~0.base c_~WrapperStruct00_var_1_7_Pointer~0.base) (= (_ bv4 32) c_~WrapperStruct00_var_1_7_Pointer~0.offset) (= c_~WrapperStruct00_var_1_18_Pointer~0.offset (_ bv33 32)) (let ((.cse5 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base))) (let ((.cse2 (select .cse5 (_ bv4 32))) (.cse1 (select .cse5 (_ bv33 32)))) (or (exists ((~WrapperStruct00_var_1_11_Pointer~0.base (_ BitVec 32))) (and (not (= c_~WrapperStruct00_var_1_18_Pointer~0.base ~WrapperStruct00_var_1_11_Pointer~0.base)) (exists ((~WrapperStruct00_var_1_11_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset))))) (and (= .cse0 .cse1) (= .cse2 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) .cse0))))))))) (exists ((~WrapperStruct00_var_1_11_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_11_Pointer~0.base (_ BitVec 32))) (= (let ((.cse3 (select |c_#memory_int#1| ~WrapperStruct00_var_1_11_Pointer~0.base))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse3 ~WrapperStruct00_var_1_11_Pointer~0.offset))))) (store (store .cse3 (_ bv33 32) .cse4) (_ bv4 32) ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) .cse4)))))) .cse5)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (let ((.cse6 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_15)))) (and (= .cse2 ((_ sign_extend 16) ((_ zero_extend 8) ((_ extract 7 0) .cse6)))) (= .cse6 .cse1)))))))) is different from true [2024-11-08 16:48:23,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:48:23,433 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 125 treesize of output 121 [2024-11-08 16:48:23,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-08 16:48:24,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-08 16:48:24,926 INFO L349 Elim1Store]: treesize reduction 31, result has 27.9 percent of original size [2024-11-08 16:48:24,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 30 [2024-11-08 16:48:25,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:48:25,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 111 [2024-11-08 16:48:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:48:26,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:48:26,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:48:26,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903015399] [2024-11-08 16:48:26,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903015399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:48:26,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:48:26,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:48:26,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399399170] [2024-11-08 16:48:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:48:26,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:48:26,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:48:26,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:48:26,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-08 16:48:26,594 INFO L87 Difference]: Start difference. First operand 191 states and 277 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:48:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:48:27,122 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2024-11-08 16:48:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:48:27,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 16:48:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:48:27,126 INFO L225 Difference]: With dead ends: 304 [2024-11-08 16:48:27,126 INFO L226 Difference]: Without dead ends: 197 [2024-11-08 16:48:27,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-08 16:48:27,128 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 27 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:48:27,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 580 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 282 Unchecked, 0.5s Time] [2024-11-08 16:48:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-08 16:48:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-08 16:48:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 164 states have (on average 1.3719512195121952) internal successors, (225), 164 states have internal predecessors, (225), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 16:48:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 285 transitions. [2024-11-08 16:48:27,150 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 285 transitions. Word has length 130 [2024-11-08 16:48:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:48:27,151 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 285 transitions. [2024-11-08 16:48:27,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:48:27,151 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 285 transitions. [2024-11-08 16:48:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 16:48:27,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:48:27,154 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:48:27,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:48:27,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:48:27,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:48:27,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:48:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1967698303, now seen corresponding path program 1 times [2024-11-08 16:48:27,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:48:27,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680178691] [2024-11-08 16:48:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:48:27,360 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-08 16:48:27,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:48:27,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:48:27,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:48:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:48:28,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:48:28,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:48:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:48:28,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:48:28,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:48:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680178691] [2024-11-08 16:48:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680178691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:48:28,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:48:28,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:48:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775805319] [2024-11-08 16:48:28,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:48:28,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:48:28,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:48:28,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:48:28,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:48:28,315 INFO L87 Difference]: Start difference. First operand 197 states and 285 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:48:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:48:28,512 INFO L93 Difference]: Finished difference Result 311 states and 450 transitions. [2024-11-08 16:48:28,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:48:28,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 16:48:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:48:28,515 INFO L225 Difference]: With dead ends: 311 [2024-11-08 16:48:28,516 INFO L226 Difference]: Without dead ends: 201 [2024-11-08 16:48:28,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:48:28,517 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:48:28,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:48:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-08 16:48:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-08 16:48:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 168 states have (on average 1.3571428571428572) internal successors, (228), 168 states have internal predecessors, (228), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 16:48:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 288 transitions. [2024-11-08 16:48:28,563 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 288 transitions. Word has length 130 [2024-11-08 16:48:28,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:48:28,565 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 288 transitions. [2024-11-08 16:48:28,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:48:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 288 transitions. [2024-11-08 16:48:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:48:28,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:48:28,570 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:48:28,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-08 16:48:28,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:48:28,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:48:28,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:48:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1862020940, now seen corresponding path program 1 times [2024-11-08 16:48:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:48:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216979457] [2024-11-08 16:48:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:48:28,775 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-08 16:48:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:48:28,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:48:28,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:48:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:48:30,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:48:30,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:48:33,302 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2024-11-08 16:48:33,302 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 1 case distinctions, treesize of input 20 treesize of output 28 [2024-11-08 16:48:34,172 INFO L349 Elim1Store]: treesize reduction 49, result has 31.0 percent of original size [2024-11-08 16:48:34,172 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 1 case distinctions, treesize of input 27 treesize of output 35 [2024-11-08 16:48:35,053 INFO L349 Elim1Store]: treesize reduction 62, result has 22.5 percent of original size [2024-11-08 16:48:35,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 56 [2024-11-08 16:48:35,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-08 16:48:36,135 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 16:48:36,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-08 16:48:40,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:48:40,736 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 813 treesize of output 753 [2024-11-08 16:48:41,637 INFO L349 Elim1Store]: treesize reduction 79, result has 19.4 percent of original size [2024-11-08 16:48:41,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 198 treesize of output 276 [2024-11-08 16:48:41,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 153 treesize of output 156 [2024-11-08 16:48:42,253 INFO L349 Elim1Store]: treesize reduction 42, result has 17.6 percent of original size [2024-11-08 16:48:42,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 165 [2024-11-08 16:48:44,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:48:44,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:48:45,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:48:46,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:48:46,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:48:46,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:48:49,970 INFO L224 Elim1Store]: Index analysis took 190 ms [2024-11-08 16:48:50,011 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:48:50,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:48:50,411 INFO L224 Elim1Store]: Index analysis took 138 ms [2024-11-08 16:48:50,441 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:48:50,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:48:50,938 INFO L224 Elim1Store]: Index analysis took 130 ms [2024-11-08 16:48:50,967 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:48:50,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:48:51,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:48:51,764 INFO L224 Elim1Store]: Index analysis took 141 ms [2024-11-08 16:48:51,794 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:48:51,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:48:52,670 INFO L224 Elim1Store]: Index analysis took 223 ms [2024-11-08 16:48:52,697 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:48:52,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:48:53,183 INFO L224 Elim1Store]: Index analysis took 206 ms [2024-11-08 16:48:53,215 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:48:53,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:48:53,735 INFO L224 Elim1Store]: Index analysis took 299 ms [2024-11-08 16:48:53,765 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:48:53,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:48:54,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:48:55,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:48:55,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:48:55,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:48:56,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:48:56,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:48:59,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-11-08 16:49:01,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:49:01,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:49:01,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:49:01,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:49:02,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:49:02,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:49:03,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:49:03,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2024-11-08 16:49:04,166 INFO L349 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2024-11-08 16:49:04,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 186 treesize of output 177 [2024-11-08 16:49:07,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:49:07,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 142 [2024-11-08 16:49:10,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:10,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:10,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:11,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:11,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:11,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:11,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:11,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 22 [2024-11-08 16:49:12,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:12,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:12,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:12,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:13,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:13,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:49:13,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:49:13,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2024-11-08 16:49:13,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:49:13,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2024-11-08 16:49:14,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:49:14,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2024-11-08 16:49:15,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:49:15,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 86 [2024-11-08 16:49:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 16:49:19,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:49:19,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:49:19,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216979457] [2024-11-08 16:49:19,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216979457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:49:19,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:49:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:49:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768144074] [2024-11-08 16:49:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:49:19,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:49:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:49:19,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:49:19,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:49:19,192 INFO L87 Difference]: Start difference. First operand 201 states and 288 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:49:24,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:49:28,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:49:37,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:49:42,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:49:48,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:49:52,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:49:56,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:50:00,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:50:11,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:50:14,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:50:18,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:50:22,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:50:26,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:50:30,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:50:34,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:50:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:50:36,618 INFO L93 Difference]: Finished difference Result 363 states and 517 transitions. [2024-11-08 16:50:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:50:36,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-08 16:50:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:50:36,626 INFO L225 Difference]: With dead ends: 363 [2024-11-08 16:50:36,626 INFO L226 Difference]: Without dead ends: 249 [2024-11-08 16:50:36,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:50:36,629 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 123 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:50:36,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 444 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 25 Unknown, 0 Unchecked, 75.0s Time] [2024-11-08 16:50:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-08 16:50:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 205. [2024-11-08 16:50:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 172 states have (on average 1.3488372093023255) internal successors, (232), 172 states have internal predecessors, (232), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 16:50:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 292 transitions. [2024-11-08 16:50:36,651 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 292 transitions. Word has length 131 [2024-11-08 16:50:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:50:36,652 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 292 transitions. [2024-11-08 16:50:36,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 16:50:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 292 transitions. [2024-11-08 16:50:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 16:50:36,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:50:36,655 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:50:36,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:50:36,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:50:36,856 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:50:36,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:50:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2093133905, now seen corresponding path program 1 times [2024-11-08 16:50:36,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:50:36,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089091129] [2024-11-08 16:50:36,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:50:36,857 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-08 16:50:36,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:50:36,858 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:50:36,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_631adbcc-ffa1-486f-af86-37f252c7f268/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:50:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:50:37,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:50:37,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:50:42,661 INFO L349 Elim1Store]: treesize reduction 62, result has 22.5 percent of original size [2024-11-08 16:50:42,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 56 [2024-11-08 16:50:43,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-08 16:50:43,927 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 16:50:43,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-08 16:50:45,584 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2024-11-08 16:50:45,584 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 1 case distinctions, treesize of input 20 treesize of output 28 [2024-11-08 16:50:46,862 INFO L349 Elim1Store]: treesize reduction 49, result has 31.0 percent of original size [2024-11-08 16:50:46,863 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 1 case distinctions, treesize of input 27 treesize of output 35 [2024-11-08 16:50:51,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:50:51,218 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 1018 treesize of output 938 [2024-11-08 16:50:52,572 INFO L349 Elim1Store]: treesize reduction 79, result has 19.4 percent of original size [2024-11-08 16:50:52,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 198 treesize of output 276 [2024-11-08 16:50:52,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 153 treesize of output 156 [2024-11-08 16:50:53,463 INFO L349 Elim1Store]: treesize reduction 42, result has 17.6 percent of original size [2024-11-08 16:50:53,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 165 [2024-11-08 16:50:57,938 INFO L224 Elim1Store]: Index analysis took 524 ms [2024-11-08 16:50:57,975 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:50:57,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2024-11-08 16:50:58,841 INFO L224 Elim1Store]: Index analysis took 351 ms [2024-11-08 16:50:58,876 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:50:58,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2024-11-08 16:51:00,233 INFO L224 Elim1Store]: Index analysis took 448 ms [2024-11-08 16:51:00,271 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:51:00,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2024-11-08 16:51:01,273 INFO L224 Elim1Store]: Index analysis took 517 ms [2024-11-08 16:51:01,312 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:51:01,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2024-11-08 16:51:02,360 INFO L224 Elim1Store]: Index analysis took 624 ms [2024-11-08 16:51:02,389 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:51:02,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2024-11-08 16:51:04,401 INFO L224 Elim1Store]: Index analysis took 693 ms [2024-11-08 16:51:04,443 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:51:04,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2024-11-08 16:51:05,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:51:05,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:51:06,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:51:07,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:51:08,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:51:08,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-08 16:51:08,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:51:08,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:51:09,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:51:09,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:51:10,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:51:11,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2024-11-08 16:51:13,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-11-08 16:51:15,131 INFO L224 Elim1Store]: Index analysis took 242 ms [2024-11-08 16:51:15,165 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:51:15,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:51:15,712 INFO L224 Elim1Store]: Index analysis took 195 ms [2024-11-08 16:51:15,747 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:51:15,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:51:16,275 INFO L224 Elim1Store]: Index analysis took 244 ms [2024-11-08 16:51:16,310 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:51:16,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:51:17,974 INFO L224 Elim1Store]: Index analysis took 283 ms [2024-11-08 16:51:18,008 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:51:18,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:51:18,583 INFO L224 Elim1Store]: Index analysis took 248 ms [2024-11-08 16:51:18,618 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:51:18,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:51:19,167 INFO L224 Elim1Store]: Index analysis took 304 ms [2024-11-08 16:51:19,195 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 16:51:19,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 22 [2024-11-08 16:51:20,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:51:20,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:51:20,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:51:21,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:51:21,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-08 16:51:23,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:23,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2024-11-08 16:51:24,222 INFO L349 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2024-11-08 16:51:24,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 160 treesize of output 151 [2024-11-08 16:51:28,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-11-08 16:51:28,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-11-08 16:51:28,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-11-08 16:51:29,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-11-08 16:51:30,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:30,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-08 16:51:32,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-11-08 16:51:32,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-11-08 16:51:33,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:33,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2024-11-08 16:51:34,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:34,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2024-11-08 16:51:34,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:34,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2024-11-08 16:51:35,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:35,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2024-11-08 16:51:35,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:35,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2024-11-08 16:51:38,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:38,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2024-11-08 16:51:38,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:38,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2024-11-08 16:51:39,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:39,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2024-11-08 16:51:40,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:40,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2024-11-08 16:51:47,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:47,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2024-11-08 16:51:49,941 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-11-08 16:51:49,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 67 treesize of output 61 [2024-11-08 16:51:50,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:50,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2024-11-08 16:51:51,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:51,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2024-11-08 16:51:51,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:51,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2024-11-08 16:51:52,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:52,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2024-11-08 16:51:53,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:51:53,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2024-11-08 16:51:54,801 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-08 16:51:54,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 66 treesize of output 59 [2024-11-08 16:52:15,238 WARN L286 SmtUtils]: Spent 15.18s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-08 16:52:15,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:52:15,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1172 treesize of output 1310