./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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_830ab993-d881-47bf-a999-614723703fce/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 f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:28:58,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:28:58,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:28:58,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:28:58,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:28:58,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:28:58,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:28:58,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:28:58,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:28:58,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:28:58,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:28:58,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:28:58,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:28:58,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:28:58,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:28:58,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:28:58,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:28:58,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:28:58,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:28:58,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:28:58,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:28:58,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:28:58,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:28:58,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:28:58,576 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:28:58,576 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:28:58,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:28:58,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:28:58,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:28:58,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:28:58,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:28:58,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:28:58,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:28:58,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:28:58,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:28:58,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:28:58,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:28:58,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:28:58,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:28:58,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:28:58,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:28:58,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:28:58,585 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_830ab993-d881-47bf-a999-614723703fce/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_830ab993-d881-47bf-a999-614723703fce/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 -> f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba [2024-11-08 17:28:58,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:28:58,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:28:58,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:28:58,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:28:58,971 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:28:58,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i Unable to find full path for "g++" [2024-11-08 17:29:00,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:29:01,269 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:29:01,273 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2024-11-08 17:29:01,289 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/data/828fa7cbf/441691bed0cd4f6a83c8499e6a161b30/FLAGcfd770119 [2024-11-08 17:29:01,626 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/data/828fa7cbf/441691bed0cd4f6a83c8499e6a161b30 [2024-11-08 17:29:01,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:29:01,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:29:01,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:01,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:29:01,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:29:01,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:01" (1/1) ... [2024-11-08 17:29:01,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b02929e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:01, skipping insertion in model container [2024-11-08 17:29:01,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:01" (1/1) ... [2024-11-08 17:29:01,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:29:01,877 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_830ab993-d881-47bf-a999-614723703fce/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-08 17:29:01,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:01,975 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:29:01,985 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_830ab993-d881-47bf-a999-614723703fce/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-08 17:29:02,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:02,065 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:29:02,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02 WrapperNode [2024-11-08 17:29:02,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:02,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:02,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:29:02,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:29:02,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,144 INFO L138 Inliner]: procedures = 29, calls = 209, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 668 [2024-11-08 17:29:02,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:02,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:29:02,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:29:02,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:29:02,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,196 INFO L175 MemorySlicer]: Split 174 memory accesses to 7 slices as follows [2, 16, 44, 90, 5, 8, 9]. 52 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 3, 4, 7, 1, 1, 2]. The 19 writes are split as follows [0, 3, 4, 7, 2, 1, 2]. [2024-11-08 17:29:02,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:29:02,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:29:02,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:29:02,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:29:02,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (1/1) ... [2024-11-08 17:29:02,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:02,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:02,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:29:02,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:29:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:29:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 17:29:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 17:29:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 17:29:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 17:29:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 17:29:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 17:29:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-08 17:29:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:29:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:29:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:29:02,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 17:29:02,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 17:29:02,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 17:29:02,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 17:29:02,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 17:29:02,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 17:29:02,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 17:29:02,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 17:29:02,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 17:29:02,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 17:29:02,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-08 17:29:02,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:29:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:29:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:29:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 17:29:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 17:29:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 17:29:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 17:29:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 17:29:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 17:29:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 17:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 17:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 17:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 17:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-08 17:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:29:02,337 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:29:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:29:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:29:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:29:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 17:29:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 17:29:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 17:29:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 17:29:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:29:02,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:29:02,562 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:29:02,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:29:03,347 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2024-11-08 17:29:03,347 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:29:03,388 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:29:03,390 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:29:03,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:03 BoogieIcfgContainer [2024-11-08 17:29:03,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:29:03,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:29:03,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:29:03,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:29:03,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:01" (1/3) ... [2024-11-08 17:29:03,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35dfbd47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:03, skipping insertion in model container [2024-11-08 17:29:03,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:02" (2/3) ... [2024-11-08 17:29:03,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35dfbd47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:03, skipping insertion in model container [2024-11-08 17:29:03,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:03" (3/3) ... [2024-11-08 17:29:03,400 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-63.i [2024-11-08 17:29:03,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:29:03,420 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:29:03,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:29:03,502 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;@3e333220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:29:03,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:29:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:03,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:03,524 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:03,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:03,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash -797780773, now seen corresponding path program 1 times [2024-11-08 17:29:03,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:03,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451860170] [2024-11-08 17:29:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:04,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:04,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451860170] [2024-11-08 17:29:04,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451860170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:04,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:04,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:29:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260324537] [2024-11-08 17:29:04,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:04,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:29:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:04,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:29:04,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:29:04,072 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:04,107 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-08 17:29:04,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:29:04,109 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-08 17:29:04,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:04,118 INFO L225 Difference]: With dead ends: 271 [2024-11-08 17:29:04,119 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 17:29:04,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 17:29:04,126 INFO L432 NwaCegarLoop]: 198 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, 198 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 17:29:04,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 17:29:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-08 17:29:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-08 17:29:04,201 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-08 17:29:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:04,205 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-08 17:29:04,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-08 17:29:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:04,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:04,214 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:04,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:29:04,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:04,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2009083895, now seen corresponding path program 1 times [2024-11-08 17:29:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:04,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581716610] [2024-11-08 17:29:04,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:04,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:04,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:04,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581716610] [2024-11-08 17:29:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581716610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:04,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931312504] [2024-11-08 17:29:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:04,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:04,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:04,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:04,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:04,854 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:04,912 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-08 17:29:04,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:04,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-08 17:29:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:04,915 INFO L225 Difference]: With dead ends: 269 [2024-11-08 17:29:04,916 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 17:29:04,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 17:29:04,918 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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 17:29:04,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 17:29:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-08 17:29:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-08 17:29:04,936 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-08 17:29:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:04,937 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-08 17:29:04,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-08 17:29:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:04,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:04,941 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:04,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:29:04,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:04,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1537727545, now seen corresponding path program 1 times [2024-11-08 17:29:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:04,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49559871] [2024-11-08 17:29:04,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:04,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:05,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49559871] [2024-11-08 17:29:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49559871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:05,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:05,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:05,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540472611] [2024-11-08 17:29:05,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:05,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:05,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:05,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:05,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:05,410 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:05,463 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2024-11-08 17:29:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:05,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-08 17:29:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:05,466 INFO L225 Difference]: With dead ends: 273 [2024-11-08 17:29:05,466 INFO L226 Difference]: Without dead ends: 139 [2024-11-08 17:29:05,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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 17:29:05,468 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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 17:29:05,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-08 17:29:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-08 17:29:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-08 17:29:05,482 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2024-11-08 17:29:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:05,483 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-08 17:29:05,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:05,483 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-08 17:29:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:05,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:05,486 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:05,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:29:05,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:05,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:05,487 INFO L85 PathProgramCache]: Analyzing trace with hash -856127852, now seen corresponding path program 1 times [2024-11-08 17:29:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:05,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271755291] [2024-11-08 17:29:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:05,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:05,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:05,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271755291] [2024-11-08 17:29:05,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271755291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:05,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:05,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:05,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319346386] [2024-11-08 17:29:05,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:05,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:05,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:05,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:05,844 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:05,892 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2024-11-08 17:29:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:05,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:29:05,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:05,896 INFO L225 Difference]: With dead ends: 278 [2024-11-08 17:29:05,896 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 17:29:05,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 17:29:05,900 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:05,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 17:29:05,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-08 17:29:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-08 17:29:05,926 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 158 [2024-11-08 17:29:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:05,928 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-08 17:29:05,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-08 17:29:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:05,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:05,933 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:05,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:29:05,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:05,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1442933866, now seen corresponding path program 1 times [2024-11-08 17:29:05,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:05,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076261985] [2024-11-08 17:29:05,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076261985] [2024-11-08 17:29:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076261985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:06,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:06,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:06,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910398835] [2024-11-08 17:29:06,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:06,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:06,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:06,229 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:06,269 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2024-11-08 17:29:06,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:06,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:29:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:06,272 INFO L225 Difference]: With dead ends: 282 [2024-11-08 17:29:06,274 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 17:29:06,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 17:29:06,276 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:06,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 17:29:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-08 17:29:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-08 17:29:06,321 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2024-11-08 17:29:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:06,322 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-08 17:29:06,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-08 17:29:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:06,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:06,324 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:06,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:29:06,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:06,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:06,325 INFO L85 PathProgramCache]: Analyzing trace with hash -762875496, now seen corresponding path program 1 times [2024-11-08 17:29:06,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:06,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023193105] [2024-11-08 17:29:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023193105] [2024-11-08 17:29:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023193105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310952282] [2024-11-08 17:29:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:06,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:06,602 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:06,636 INFO L93 Difference]: Finished difference Result 286 states and 413 transitions. [2024-11-08 17:29:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:06,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:29:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:06,640 INFO L225 Difference]: With dead ends: 286 [2024-11-08 17:29:06,640 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 17:29:06,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 17:29:06,642 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:06,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 17:29:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-08 17:29:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2024-11-08 17:29:06,663 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2024-11-08 17:29:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:06,663 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2024-11-08 17:29:06,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2024-11-08 17:29:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:06,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:06,666 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:06,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:29:06,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:06,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1012131866, now seen corresponding path program 1 times [2024-11-08 17:29:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758905469] [2024-11-08 17:29:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:06,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758905469] [2024-11-08 17:29:06,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758905469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:06,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:06,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:06,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429176049] [2024-11-08 17:29:06,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:06,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:06,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:06,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:06,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:06,911 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:06,944 INFO L93 Difference]: Finished difference Result 290 states and 417 transitions. [2024-11-08 17:29:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:06,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:29:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:06,946 INFO L225 Difference]: With dead ends: 290 [2024-11-08 17:29:06,946 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 17:29:06,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 17:29:06,948 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:06,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 17:29:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-08 17:29:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2024-11-08 17:29:06,967 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 158 [2024-11-08 17:29:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:06,968 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2024-11-08 17:29:06,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2024-11-08 17:29:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:06,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:06,970 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:06,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:29:06,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:06,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1013978908, now seen corresponding path program 1 times [2024-11-08 17:29:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581321152] [2024-11-08 17:29:06,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:29:08,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:08,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581321152] [2024-11-08 17:29:08,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581321152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:08,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708324972] [2024-11-08 17:29:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:08,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:08,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:08,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:29:08,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:29:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:08,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 17:29:08,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:08,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-08 17:29:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-11-08 17:29:09,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:29:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708324972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:29:09,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:29:09,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-08 17:29:09,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303083103] [2024-11-08 17:29:09,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:29:09,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:29:09,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:29:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:29:09,635 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-08 17:29:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:10,110 INFO L93 Difference]: Finished difference Result 299 states and 424 transitions. [2024-11-08 17:29:10,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:29:10,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 158 [2024-11-08 17:29:10,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:10,115 INFO L225 Difference]: With dead ends: 299 [2024-11-08 17:29:10,116 INFO L226 Difference]: Without dead ends: 155 [2024-11-08 17:29:10,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:29:10,118 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 568 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:10,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 833 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:29:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-08 17:29:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2024-11-08 17:29:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 212 transitions. [2024-11-08 17:29:10,129 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 212 transitions. Word has length 158 [2024-11-08 17:29:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:10,130 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 212 transitions. [2024-11-08 17:29:10,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-08 17:29:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 212 transitions. [2024-11-08 17:29:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:10,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:10,132 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:10,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:29:10,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:29:10,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:10,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash -980165798, now seen corresponding path program 1 times [2024-11-08 17:29:10,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:10,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055727478] [2024-11-08 17:29:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:11,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:11,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055727478] [2024-11-08 17:29:11,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055727478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:11,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:29:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691232011] [2024-11-08 17:29:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:11,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:29:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:11,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:29:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:29:11,351 INFO L87 Difference]: Start difference. First operand 151 states and 212 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:11,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:11,507 INFO L93 Difference]: Finished difference Result 445 states and 628 transitions. [2024-11-08 17:29:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:29:11,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:29:11,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:11,510 INFO L225 Difference]: With dead ends: 445 [2024-11-08 17:29:11,510 INFO L226 Difference]: Without dead ends: 297 [2024-11-08 17:29:11,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:29:11,513 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 128 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:11,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1243 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:11,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-08 17:29:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 291. [2024-11-08 17:29:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 250 states have (on average 1.36) internal successors, (340), 250 states have internal predecessors, (340), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:29:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 412 transitions. [2024-11-08 17:29:11,543 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 412 transitions. Word has length 158 [2024-11-08 17:29:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:11,543 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 412 transitions. [2024-11-08 17:29:11,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 412 transitions. [2024-11-08 17:29:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:29:11,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:11,546 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:11,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:29:11,546 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:11,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:11,547 INFO L85 PathProgramCache]: Analyzing trace with hash 649124831, now seen corresponding path program 1 times [2024-11-08 17:29:11,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:11,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539996824] [2024-11-08 17:29:11,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:12,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:12,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539996824] [2024-11-08 17:29:12,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539996824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:12,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:12,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:29:12,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008318564] [2024-11-08 17:29:12,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:12,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:12,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:12,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:12,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:12,650 INFO L87 Difference]: Start difference. First operand 291 states and 412 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:12,882 INFO L93 Difference]: Finished difference Result 578 states and 817 transitions. [2024-11-08 17:29:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:29:12,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-08 17:29:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:12,885 INFO L225 Difference]: With dead ends: 578 [2024-11-08 17:29:12,886 INFO L226 Difference]: Without dead ends: 429 [2024-11-08 17:29:12,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:12,887 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 171 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:12,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1427 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:29:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-08 17:29:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 316. [2024-11-08 17:29:12,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 275 states have (on average 1.3709090909090909) internal successors, (377), 275 states have internal predecessors, (377), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:29:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 449 transitions. [2024-11-08 17:29:12,913 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 449 transitions. Word has length 160 [2024-11-08 17:29:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:12,913 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 449 transitions. [2024-11-08 17:29:12,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 449 transitions. [2024-11-08 17:29:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:29:12,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:12,916 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:12,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:29:12,916 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:12,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1350724705, now seen corresponding path program 1 times [2024-11-08 17:29:12,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:12,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800472428] [2024-11-08 17:29:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:13,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:13,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800472428] [2024-11-08 17:29:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800472428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:13,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:13,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:29:13,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401213134] [2024-11-08 17:29:13,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:13,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:29:13,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:13,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:29:13,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:13,815 INFO L87 Difference]: Start difference. First operand 316 states and 449 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:14,033 INFO L93 Difference]: Finished difference Result 636 states and 903 transitions. [2024-11-08 17:29:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:29:14,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-08 17:29:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:14,038 INFO L225 Difference]: With dead ends: 636 [2024-11-08 17:29:14,038 INFO L226 Difference]: Without dead ends: 463 [2024-11-08 17:29:14,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:29:14,041 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 182 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:14,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1276 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:14,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-08 17:29:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 316. [2024-11-08 17:29:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 275 states have (on average 1.3709090909090909) internal successors, (377), 275 states have internal predecessors, (377), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:29:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 449 transitions. [2024-11-08 17:29:14,080 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 449 transitions. Word has length 160 [2024-11-08 17:29:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:14,081 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 449 transitions. [2024-11-08 17:29:14,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 449 transitions. [2024-11-08 17:29:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:29:14,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:14,085 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:14,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:29:14,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:14,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:14,086 INFO L85 PathProgramCache]: Analyzing trace with hash -355983565, now seen corresponding path program 1 times [2024-11-08 17:29:14,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:14,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357105421] [2024-11-08 17:29:14,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:14,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:15,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357105421] [2024-11-08 17:29:15,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357105421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:15,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:15,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:29:15,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004421662] [2024-11-08 17:29:15,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:15,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:15,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:15,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:15,127 INFO L87 Difference]: Start difference. First operand 316 states and 449 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:15,422 INFO L93 Difference]: Finished difference Result 701 states and 994 transitions. [2024-11-08 17:29:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-08 17:29:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:15,426 INFO L225 Difference]: With dead ends: 701 [2024-11-08 17:29:15,427 INFO L226 Difference]: Without dead ends: 388 [2024-11-08 17:29:15,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:15,429 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 167 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:15,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1149 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:29:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-08 17:29:15,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 387. [2024-11-08 17:29:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 327 states have (on average 1.348623853211009) internal successors, (441), 328 states have internal predecessors, (441), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 17:29:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 545 transitions. [2024-11-08 17:29:15,504 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 545 transitions. Word has length 160 [2024-11-08 17:29:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:15,505 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 545 transitions. [2024-11-08 17:29:15,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 545 transitions. [2024-11-08 17:29:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:29:15,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:15,508 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:15,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:29:15,509 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:15,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash -942789579, now seen corresponding path program 1 times [2024-11-08 17:29:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:15,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685568822] [2024-11-08 17:29:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685568822] [2024-11-08 17:29:15,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685568822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:15,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:15,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:29:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913264553] [2024-11-08 17:29:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:15,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:15,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:15,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:15,969 INFO L87 Difference]: Start difference. First operand 387 states and 545 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:16,347 INFO L93 Difference]: Finished difference Result 974 states and 1358 transitions. [2024-11-08 17:29:16,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:16,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2024-11-08 17:29:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:16,352 INFO L225 Difference]: With dead ends: 974 [2024-11-08 17:29:16,352 INFO L226 Difference]: Without dead ends: 649 [2024-11-08 17:29:16,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:29:16,354 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 144 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:16,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1144 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:29:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-08 17:29:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 531. [2024-11-08 17:29:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 450 states have (on average 1.3355555555555556) internal successors, (601), 452 states have internal predecessors, (601), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 17:29:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 741 transitions. [2024-11-08 17:29:16,431 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 741 transitions. Word has length 160 [2024-11-08 17:29:16,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:16,432 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 741 transitions. [2024-11-08 17:29:16,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 741 transitions. [2024-11-08 17:29:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:29:16,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:16,435 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:16,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:29:16,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:16,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1624224721, now seen corresponding path program 1 times [2024-11-08 17:29:16,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:16,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422418332] [2024-11-08 17:29:16,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:17,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422418332] [2024-11-08 17:29:17,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422418332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:17,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:17,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:29:17,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893874587] [2024-11-08 17:29:17,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:17,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:29:17,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:17,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:29:17,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:29:17,610 INFO L87 Difference]: Start difference. First operand 531 states and 741 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:17,806 INFO L93 Difference]: Finished difference Result 542 states and 754 transitions. [2024-11-08 17:29:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:29:17,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2024-11-08 17:29:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:17,809 INFO L225 Difference]: With dead ends: 542 [2024-11-08 17:29:17,810 INFO L226 Difference]: Without dead ends: 540 [2024-11-08 17:29:17,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:29:17,811 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 75 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:17,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1014 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-08 17:29:17,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2024-11-08 17:29:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 459 states have (on average 1.328976034858388) internal successors, (610), 461 states have internal predecessors, (610), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 17:29:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 750 transitions. [2024-11-08 17:29:17,884 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 750 transitions. Word has length 163 [2024-11-08 17:29:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:17,885 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 750 transitions. [2024-11-08 17:29:17,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 750 transitions. [2024-11-08 17:29:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:29:17,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:17,888 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:17,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:29:17,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:17,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:17,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1626071763, now seen corresponding path program 1 times [2024-11-08 17:29:17,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:17,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319123878] [2024-11-08 17:29:17,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:17,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:18,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:18,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319123878] [2024-11-08 17:29:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319123878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:18,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:18,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:18,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798104309] [2024-11-08 17:29:18,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:18,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:18,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:18,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:18,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:18,313 INFO L87 Difference]: Start difference. First operand 540 states and 750 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:18,580 INFO L93 Difference]: Finished difference Result 1034 states and 1423 transitions. [2024-11-08 17:29:18,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:18,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-08 17:29:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:18,584 INFO L225 Difference]: With dead ends: 1034 [2024-11-08 17:29:18,584 INFO L226 Difference]: Without dead ends: 556 [2024-11-08 17:29:18,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:29:18,586 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 133 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:18,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 461 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-08 17:29:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-08 17:29:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 471 states have (on average 1.3142250530785562) internal successors, (619), 473 states have internal predecessors, (619), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 17:29:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 759 transitions. [2024-11-08 17:29:18,690 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 759 transitions. Word has length 163 [2024-11-08 17:29:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:18,691 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 759 transitions. [2024-11-08 17:29:18,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 759 transitions. [2024-11-08 17:29:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:29:18,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:18,694 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:18,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:29:18,694 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:18,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash -893888171, now seen corresponding path program 1 times [2024-11-08 17:29:18,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:18,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912268257] [2024-11-08 17:29:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912268257] [2024-11-08 17:29:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912268257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:18,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071237887] [2024-11-08 17:29:18,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:18,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:18,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:18,998 INFO L87 Difference]: Start difference. First operand 556 states and 759 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:19,138 INFO L93 Difference]: Finished difference Result 1046 states and 1426 transitions. [2024-11-08 17:29:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:19,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-08 17:29:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:19,142 INFO L225 Difference]: With dead ends: 1046 [2024-11-08 17:29:19,142 INFO L226 Difference]: Without dead ends: 556 [2024-11-08 17:29:19,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:29:19,144 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 167 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:19,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 554 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:19,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-08 17:29:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-08 17:29:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 471 states have (on average 1.3078556263269638) internal successors, (616), 473 states have internal predecessors, (616), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 17:29:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 756 transitions. [2024-11-08 17:29:19,229 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 756 transitions. Word has length 163 [2024-11-08 17:29:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:19,230 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 756 transitions. [2024-11-08 17:29:19,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 756 transitions. [2024-11-08 17:29:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:29:19,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:19,233 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:19,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:29:19,233 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:19,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash -213829801, now seen corresponding path program 1 times [2024-11-08 17:29:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565644132] [2024-11-08 17:29:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:29:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 17:29:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:29:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:29:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 17:29:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:29:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:29:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:29:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:29:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:29:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:29:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:29:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:29:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:29:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:19,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:19,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565644132] [2024-11-08 17:29:19,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565644132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:19,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:19,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:19,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813698860] [2024-11-08 17:29:19,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:19,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:19,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:19,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:19,505 INFO L87 Difference]: Start difference. First operand 556 states and 756 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:19,614 INFO L93 Difference]: Finished difference Result 1055 states and 1432 transitions. [2024-11-08 17:29:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:19,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2024-11-08 17:29:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:19,618 INFO L225 Difference]: With dead ends: 1055 [2024-11-08 17:29:19,618 INFO L226 Difference]: Without dead ends: 565 [2024-11-08 17:29:19,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 17:29:19,621 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:19,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-08 17:29:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2024-11-08 17:29:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 480 states have (on average 1.3020833333333333) internal successors, (625), 482 states have internal predecessors, (625), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 17:29:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 765 transitions. [2024-11-08 17:29:19,707 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 765 transitions. Word has length 163 [2024-11-08 17:29:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:19,707 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 765 transitions. [2024-11-08 17:29:19,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 765 transitions. [2024-11-08 17:29:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 17:29:19,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:19,710 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:29:19,711 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:19,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:19,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1537195341, now seen corresponding path program 1 times [2024-11-08 17:29:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387740307] [2024-11-08 17:29:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:19,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:29:19,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:29:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:29:19,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:29:19,953 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:29:19,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:29:19,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:29:19,961 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:20,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:29:20,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:29:20 BoogieIcfgContainer [2024-11-08 17:29:20,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:29:20,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:29:20,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:29:20,107 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:29:20,108 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:03" (3/4) ... [2024-11-08 17:29:20,111 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:29:20,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:29:20,113 INFO L158 Benchmark]: Toolchain (without parser) took 18482.39ms. Allocated memory was 161.5MB in the beginning and 434.1MB in the end (delta: 272.6MB). Free memory was 128.2MB in the beginning and 191.2MB in the end (delta: -63.0MB). Peak memory consumption was 211.7MB. Max. memory is 16.1GB. [2024-11-08 17:29:20,113 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:29:20,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.15ms. Allocated memory is still 161.5MB. Free memory was 127.7MB in the beginning and 109.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 17:29:20,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.31ms. Allocated memory is still 161.5MB. Free memory was 109.8MB in the beginning and 105.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:29:20,114 INFO L158 Benchmark]: Boogie Preprocessor took 100.08ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 99.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 17:29:20,115 INFO L158 Benchmark]: RCFGBuilder took 1144.74ms. Allocated memory is still 161.5MB. Free memory was 99.4MB in the beginning and 128.8MB in the end (delta: -29.4MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2024-11-08 17:29:20,115 INFO L158 Benchmark]: TraceAbstraction took 16713.91ms. Allocated memory was 161.5MB in the beginning and 434.1MB in the end (delta: 272.6MB). Free memory was 128.0MB in the beginning and 191.2MB in the end (delta: -63.2MB). Peak memory consumption was 209.2MB. Max. memory is 16.1GB. [2024-11-08 17:29:20,115 INFO L158 Benchmark]: Witness Printer took 5.57ms. Allocated memory is still 434.1MB. Free memory is still 191.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:29:20,117 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.27ms. Allocated memory is still 109.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.15ms. Allocated memory is still 161.5MB. Free memory was 127.7MB in the beginning and 109.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.31ms. Allocated memory is still 161.5MB. Free memory was 109.8MB in the beginning and 105.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.08ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 99.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1144.74ms. Allocated memory is still 161.5MB. Free memory was 99.4MB in the beginning and 128.8MB in the end (delta: -29.4MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16713.91ms. Allocated memory was 161.5MB in the beginning and 434.1MB in the end (delta: 272.6MB). Free memory was 128.0MB in the beginning and 191.2MB in the end (delta: -63.2MB). Peak memory consumption was 209.2MB. Max. memory is 16.1GB. * Witness Printer took 5.57ms. Allocated memory is still 434.1MB. Free memory is still 191.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 256 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 256 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L40] signed short int last_1_signed_short_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] EXPR signed_short_int_Array_0[0] [L93] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] float_Array_0[0][0] = __VERIFIER_nondet_float() [L66] EXPR float_Array_0[0][0] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F [L66] EXPR float_Array_0[0][0] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] float_Array_0[1][0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[1][0] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L68] EXPR float_Array_0[1][0] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L69] float_Array_0[0][1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L71] float_Array_0[1][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] signed_char_Array_0[5] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR signed_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[5] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[5] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] signed_char_Array_0[6] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[6] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[6] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L104] RET updateVariables() [L105] CALL step() [L44] EXPR unsigned_long_int_Array_0[1] [L44] unsigned_long_int_Array_0[0] = unsigned_long_int_Array_0[1] [L45] signed_short_int_Array_0[0] = last_1_signed_short_int_Array_0_0_ [L46] EXPR signed_char_Array_0[2] [L46] signed_char_Array_0[1] = signed_char_Array_0[2] [L47] EXPR BOOL_unsigned_char_Array_0[1] [L47] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L48] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) [L48] EXPR float_Array_0[1][1] [L48] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] EXPR float_Array_0[0][1] [L48] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] COND FALSE !(((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) [L51] EXPR signed_char_Array_0[1] [L51] signed char stepLocal_0 = signed_char_Array_0[1]; [L52] EXPR signed_char_Array_0[1] [L52] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L52] EXPR ((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0]) [L52] EXPR signed_char_Array_0[1] [L52] EXPR ((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=21, unsigned_long_int_Array_0={9:0}] [L52] COND FALSE !(stepLocal_0 != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) [L55] EXPR float_Array_0[1][0] [L55] EXPR float_Array_0[1][1] [L55] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) [L55] EXPR float_Array_0[0][1] [L55] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] COND TRUE float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[4] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] signed_long_int_Array_0[0] = (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) [L96] EXPR float_Array_0[1][1] [L96] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR float_Array_0[0][1] [L96] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1 [L96] EXPR (((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) [L96] EXPR float_Array_0[1][0] [L96] EXPR float_Array_0[1][1] [L96] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) [L96] EXPR float_Array_0[1][1] [L96] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) [L96] EXPR signed_long_int_Array_0[0] [L96] EXPR signed_char_Array_0[1] [L96] EXPR (float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96-L97] return (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 18, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1743 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1739 mSDsluCounter, 13513 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9950 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1222 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 3563 mSDtfsCounter, 1222 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1076 GetRequests, 982 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=565occurred in iteration=17, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 393 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 3033 NumberOfCodeBlocks, 3033 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3005 ConstructedInterpolants, 0 QuantifiedInterpolants, 9741 SizeOfPredicates, 2 NumberOfNonLiveVariables, 558 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 11484/11628 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 17:29:20,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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_830ab993-d881-47bf-a999-614723703fce/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 f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:29:22,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:29:22,591 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:29:22,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:29:22,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:29:22,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:29:22,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:29:22,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:29:22,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:29:22,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:29:22,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:29:22,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:29:22,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:29:22,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:29:22,631 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:29:22,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:29:22,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:29:22,632 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:29:22,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:29:22,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:29:22,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:29:22,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:29:22,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:29:22,638 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:29:22,638 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:29:22,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:29:22,638 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:29:22,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:29:22,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:29:22,639 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:29:22,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:29:22,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:29:22,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:29:22,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:29:22,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:22,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:29:22,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:29:22,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:29:22,644 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:29:22,644 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:29:22,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:29:22,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:29:22,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:29:22,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:29:22,647 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_830ab993-d881-47bf-a999-614723703fce/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_830ab993-d881-47bf-a999-614723703fce/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 -> f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba [2024-11-08 17:29:23,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:29:23,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:29:23,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:29:23,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:29:23,093 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:29:23,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i Unable to find full path for "g++" [2024-11-08 17:29:25,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:29:25,338 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:29:25,338 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2024-11-08 17:29:25,348 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/data/184af2695/2976d525f79e47aa9a113219ff8eaf70/FLAG0b6374f90 [2024-11-08 17:29:25,364 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/data/184af2695/2976d525f79e47aa9a113219ff8eaf70 [2024-11-08 17:29:25,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:29:25,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:29:25,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:25,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:29:25,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:29:25,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:25,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796f6fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25, skipping insertion in model container [2024-11-08 17:29:25,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:25,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:29:25,629 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_830ab993-d881-47bf-a999-614723703fce/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-08 17:29:25,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:25,795 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:29:25,812 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_830ab993-d881-47bf-a999-614723703fce/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2024-11-08 17:29:25,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:25,963 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:29:25,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25 WrapperNode [2024-11-08 17:29:25,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:25,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:25,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:29:25,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:29:25,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,065 INFO L138 Inliner]: procedures = 36, calls = 209, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 663 [2024-11-08 17:29:26,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:26,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:29:26,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:29:26,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:29:26,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,143 INFO L175 MemorySlicer]: Split 174 memory accesses to 7 slices as follows [2, 16, 44, 90, 5, 8, 9]. 52 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 3, 4, 7, 1, 1, 2]. The 19 writes are split as follows [0, 3, 4, 7, 2, 1, 2]. [2024-11-08 17:29:26,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,181 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:29:26,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:29:26,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:29:26,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:29:26,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (1/1) ... [2024-11-08 17:29:26,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:26,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:26,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:29:26,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:29:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:29:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:29:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:29:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 17:29:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 17:29:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 17:29:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 17:29:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-08 17:29:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 17:29:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 17:29:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 17:29:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 17:29:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 17:29:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-08 17:29:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-08 17:29:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:29:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:29:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 17:29:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 17:29:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 17:29:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 17:29:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-08 17:29:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 17:29:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 17:29:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 17:29:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 17:29:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 17:29:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-08 17:29:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-08 17:29:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 17:29:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 17:29:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 17:29:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 17:29:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-08 17:29:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-08 17:29:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-08 17:29:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:29:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:29:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 17:29:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 17:29:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 17:29:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-08 17:29:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-08 17:29:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 17:29:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 17:29:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 17:29:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 17:29:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 17:29:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-08 17:29:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-08 17:29:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 17:29:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 17:29:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 17:29:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 17:29:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-08 17:29:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-08 17:29:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-08 17:29:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 17:29:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 17:29:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 17:29:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 17:29:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-08 17:29:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-08 17:29:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-08 17:29:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:29:26,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:29:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:29:26,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:29:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:29:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:29:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 17:29:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 17:29:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 17:29:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 17:29:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-08 17:29:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 17:29:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 17:29:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 17:29:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 17:29:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 17:29:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-08 17:29:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-08 17:29:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:29:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:29:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 17:29:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 17:29:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 17:29:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-08 17:29:26,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-08 17:29:26,566 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:29:26,569 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:29:29,483 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-08 17:29:29,484 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:29:29,506 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:29:29,506 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:29:29,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:29 BoogieIcfgContainer [2024-11-08 17:29:29,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:29:29,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:29:29,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:29:29,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:29:29,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:25" (1/3) ... [2024-11-08 17:29:29,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677331a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:29, skipping insertion in model container [2024-11-08 17:29:29,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:25" (2/3) ... [2024-11-08 17:29:29,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677331a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:29, skipping insertion in model container [2024-11-08 17:29:29,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:29" (3/3) ... [2024-11-08 17:29:29,514 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-63.i [2024-11-08 17:29:29,535 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:29:29,535 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:29:29,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:29:29,631 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;@ad8f2ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:29:29,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:29:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:29,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:29,660 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:29,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:29,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash -797780773, now seen corresponding path program 1 times [2024-11-08 17:29:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:29,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255569711] [2024-11-08 17:29:29,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:29,688 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 17:29:29,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:29,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:29,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:30,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:29:30,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 17:29:30,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:30,463 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:30,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255569711] [2024-11-08 17:29:30,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255569711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:30,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:30,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:29:30,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607518876] [2024-11-08 17:29:30,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:30,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:29:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:30,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:29:30,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:29:30,510 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:30,560 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2024-11-08 17:29:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:29:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-08 17:29:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:30,575 INFO L225 Difference]: With dead ends: 271 [2024-11-08 17:29:30,575 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 17:29:30,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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 17:29:30,583 INFO L432 NwaCegarLoop]: 198 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, 198 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 17:29:30,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 17:29:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-08 17:29:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-08 17:29:30,632 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2024-11-08 17:29:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:30,633 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-08 17:29:30,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-08 17:29:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:30,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:30,643 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:30,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:30,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:30,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:30,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:30,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2009083895, now seen corresponding path program 1 times [2024-11-08 17:29:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:30,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568937761] [2024-11-08 17:29:30,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:30,847 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 17:29:30,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:30,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:30,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:31,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:29:31,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-08 17:29:31,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:31,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:31,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568937761] [2024-11-08 17:29:31,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568937761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:31,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:31,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142806064] [2024-11-08 17:29:31,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:31,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:31,567 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:31,700 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2024-11-08 17:29:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:31,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-08 17:29:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:31,705 INFO L225 Difference]: With dead ends: 269 [2024-11-08 17:29:31,705 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 17:29:31,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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 17:29:31,712 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:31,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 17:29:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-08 17:29:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-08 17:29:31,736 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2024-11-08 17:29:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:31,738 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-08 17:29:31,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 17:29:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-08 17:29:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:31,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:31,746 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:31,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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)] Ended with exit code 0 [2024-11-08 17:29:31,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:31,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:31,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1537727545, now seen corresponding path program 1 times [2024-11-08 17:29:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:31,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532762754] [2024-11-08 17:29:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:31,949 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 17:29:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:31,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:31,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:29:32,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:32,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:32,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532762754] [2024-11-08 17:29:32,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532762754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:32,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:32,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:32,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409131997] [2024-11-08 17:29:32,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:32,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:32,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:32,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:32,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:32,638 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:32,712 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2024-11-08 17:29:32,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:32,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2024-11-08 17:29:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:32,731 INFO L225 Difference]: With dead ends: 273 [2024-11-08 17:29:32,734 INFO L226 Difference]: Without dead ends: 139 [2024-11-08 17:29:32,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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 17:29:32,737 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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 17:29:32,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-08 17:29:32,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-08 17:29:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-11-08 17:29:32,773 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2024-11-08 17:29:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:32,777 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-11-08 17:29:32,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-11-08 17:29:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:32,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:32,784 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:32,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:32,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:32,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:32,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:32,986 INFO L85 PathProgramCache]: Analyzing trace with hash -856127852, now seen corresponding path program 1 times [2024-11-08 17:29:32,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:32,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833321059] [2024-11-08 17:29:32,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:32,987 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 17:29:32,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:32,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:32,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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)] Waiting until timeout for monitored process [2024-11-08 17:29:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:29:33,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:34,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-08 17:29:34,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:29:34,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2024-11-08 17:29:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-11-08 17:29:34,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 17:29:35,337 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:35,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833321059] [2024-11-08 17:29:35,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833321059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:29:35,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:29:35,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-08 17:29:35,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479541615] [2024-11-08 17:29:35,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:29:35,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:29:35,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:35,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:29:35,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:29:35,341 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-08 17:29:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:36,759 INFO L93 Difference]: Finished difference Result 283 states and 408 transitions. [2024-11-08 17:29:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:29:36,760 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 158 [2024-11-08 17:29:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:36,762 INFO L225 Difference]: With dead ends: 283 [2024-11-08 17:29:36,762 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 17:29:36,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:29:36,764 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 190 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:36,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 835 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:29:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 17:29:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2024-11-08 17:29:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 122 states have internal predecessors, (168), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 204 transitions. [2024-11-08 17:29:36,792 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 204 transitions. Word has length 158 [2024-11-08 17:29:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:36,793 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 204 transitions. [2024-11-08 17:29:36,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-08 17:29:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2024-11-08 17:29:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:36,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:36,796 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:36,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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)] Ended with exit code 0 [2024-11-08 17:29:36,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:36,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:36,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1444694738, now seen corresponding path program 1 times [2024-11-08 17:29:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:36,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041332606] [2024-11-08 17:29:36,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:36,999 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 17:29:36,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:37,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:37,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:29:37,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:37,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:37,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:37,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041332606] [2024-11-08 17:29:37,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041332606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:37,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:37,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:37,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599414593] [2024-11-08 17:29:37,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:37,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:37,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:37,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:37,574 INFO L87 Difference]: Start difference. First operand 143 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:37,629 INFO L93 Difference]: Finished difference Result 286 states and 409 transitions. [2024-11-08 17:29:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:37,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:29:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:37,632 INFO L225 Difference]: With dead ends: 286 [2024-11-08 17:29:37,632 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 17:29:37,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 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 17:29:37,634 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:37,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 571 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 17:29:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-08 17:29:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 124 states have internal predecessors, (170), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 206 transitions. [2024-11-08 17:29:37,663 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 206 transitions. Word has length 158 [2024-11-08 17:29:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:37,664 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 206 transitions. [2024-11-08 17:29:37,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 206 transitions. [2024-11-08 17:29:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:37,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:37,669 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:37,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:37,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:37,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:37,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:37,870 INFO L85 PathProgramCache]: Analyzing trace with hash 857888724, now seen corresponding path program 1 times [2024-11-08 17:29:37,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:37,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877841950] [2024-11-08 17:29:37,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:37,871 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 17:29:37,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:37,874 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:37,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:29:38,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:38,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:38,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:38,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877841950] [2024-11-08 17:29:38,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877841950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:38,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:38,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:29:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22315645] [2024-11-08 17:29:38,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:38,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:38,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:38,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:38,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:38,527 INFO L87 Difference]: Start difference. First operand 145 states and 206 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:38,644 INFO L93 Difference]: Finished difference Result 292 states and 416 transitions. [2024-11-08 17:29:38,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:38,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:29:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:38,649 INFO L225 Difference]: With dead ends: 292 [2024-11-08 17:29:38,649 INFO L226 Difference]: Without dead ends: 150 [2024-11-08 17:29:38,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:29:38,651 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:38,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 930 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-08 17:29:38,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2024-11-08 17:29:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 210 transitions. [2024-11-08 17:29:38,676 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 210 transitions. Word has length 158 [2024-11-08 17:29:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:38,678 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 210 transitions. [2024-11-08 17:29:38,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2024-11-08 17:29:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:38,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:38,681 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:38,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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)] Ended with exit code 0 [2024-11-08 17:29:38,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:38,883 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:38,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:38,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1537947094, now seen corresponding path program 1 times [2024-11-08 17:29:38,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:38,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226598533] [2024-11-08 17:29:38,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:38,885 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 17:29:38,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:38,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:38,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:39,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:29:39,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:39,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:39,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:39,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226598533] [2024-11-08 17:29:39,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226598533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:39,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:39,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:29:39,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300009940] [2024-11-08 17:29:39,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:39,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:29:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:39,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:29:39,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:29:39,531 INFO L87 Difference]: Start difference. First operand 149 states and 210 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:39,663 INFO L93 Difference]: Finished difference Result 298 states and 421 transitions. [2024-11-08 17:29:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:29:39,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:29:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:39,665 INFO L225 Difference]: With dead ends: 298 [2024-11-08 17:29:39,666 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 17:29:39,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:29:39,667 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:39,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1104 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 17:29:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2024-11-08 17:29:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 212 transitions. [2024-11-08 17:29:39,679 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 212 transitions. Word has length 158 [2024-11-08 17:29:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:39,680 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 212 transitions. [2024-11-08 17:29:39,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 212 transitions. [2024-11-08 17:29:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:39,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:39,683 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:39,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:39,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:39,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:39,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash -982012840, now seen corresponding path program 1 times [2024-11-08 17:29:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:39,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168818233] [2024-11-08 17:29:39,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:39,885 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 17:29:39,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:39,886 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:39,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:40,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:29:40,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 17:29:40,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:29:40,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:40,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168818233] [2024-11-08 17:29:40,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168818233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:40,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:40,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:29:40,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177778631] [2024-11-08 17:29:40,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:40,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:29:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:29:40,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:40,521 INFO L87 Difference]: Start difference. First operand 151 states and 212 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:40,706 INFO L93 Difference]: Finished difference Result 302 states and 425 transitions. [2024-11-08 17:29:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:29:40,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2024-11-08 17:29:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:40,709 INFO L225 Difference]: With dead ends: 302 [2024-11-08 17:29:40,709 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 17:29:40,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:29:40,711 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:40,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1280 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 17:29:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2024-11-08 17:29:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 132 states have internal predecessors, (178), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:29:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 214 transitions. [2024-11-08 17:29:40,725 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 214 transitions. Word has length 158 [2024-11-08 17:29:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:40,726 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 214 transitions. [2024-11-08 17:29:40,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 17:29:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 214 transitions. [2024-11-08 17:29:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:29:40,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:40,730 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:29:40,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:29:40,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:40,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:40,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash -980165798, now seen corresponding path program 1 times [2024-11-08 17:29:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842760714] [2024-11-08 17:29:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:40,932 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 17:29:40,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:40,933 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 17:29:40,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_830ab993-d881-47bf-a999-614723703fce/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 (10)] Waiting until timeout for monitored process