./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:22:40,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:22:40,372 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:22:40,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:22:40,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:22:40,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:22:40,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:22:40,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:22:40,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:22:40,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:22:40,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:22:40,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:22:40,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:22:40,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:22:40,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:22:40,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:22:40,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:22:40,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:22:40,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:22:40,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:22:40,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:22:40,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:22:40,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:22:40,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:22:40,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:22:40,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:22:40,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:22:40,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:22:40,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:22:40,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:22:40,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:22:40,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:22:40,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:22:40,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:22:40,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:22:40,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:22:40,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:22:40,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:22:40,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:22:40,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:22:40,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:22:40,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:22:40,459 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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 -> e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 [2024-11-08 17:22:40,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:22:40,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:22:40,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:22:40,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:22:40,950 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:22:40,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i Unable to find full path for "g++" [2024-11-08 17:22:43,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:22:43,688 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:22:43,689 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2024-11-08 17:22:43,701 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/data/ff1be7450/8aabe7e5de00417ba0427c3b045144e8/FLAG5e60dd3a5 [2024-11-08 17:22:43,980 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/data/ff1be7450/8aabe7e5de00417ba0427c3b045144e8 [2024-11-08 17:22:43,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:22:43,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:22:43,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:22:43,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:22:44,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:22:44,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:22:43" (1/1) ... [2024-11-08 17:22:44,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ca776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44, skipping insertion in model container [2024-11-08 17:22:44,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:22:43" (1/1) ... [2024-11-08 17:22:44,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:22:44,324 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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2024-11-08 17:22:44,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:22:44,434 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:22:44,452 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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2024-11-08 17:22:44,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:22:44,535 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:22:44,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44 WrapperNode [2024-11-08 17:22:44,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:22:44,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:22:44,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:22:44,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:22:44,546 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:22:44" (1/1) ... [2024-11-08 17:22:44,568 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:22:44" (1/1) ... [2024-11-08 17:22:44,625 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-11-08 17:22:44,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:22:44,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:22:44,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:22:44,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:22:44,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (1/1) ... [2024-11-08 17:22:44,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (1/1) ... [2024-11-08 17:22:44,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (1/1) ... [2024-11-08 17:22:44,678 INFO L175 MemorySlicer]: Split 130 memory accesses to 14 slices as follows [2, 3, 11, 9, 13, 18, 14, 6, 8, 8, 11, 11, 6, 10]. 14 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2024-11-08 17:22:44,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (1/1) ... [2024-11-08 17:22:44,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (1/1) ... [2024-11-08 17:22:44,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (1/1) ... [2024-11-08 17:22:44,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (1/1) ... [2024-11-08 17:22:44,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (1/1) ... [2024-11-08 17:22:44,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (1/1) ... [2024-11-08 17:22:44,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:22:44,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:22:44,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:22:44,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:22:44,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (1/1) ... [2024-11-08 17:22:44,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:22:44,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:22:44,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:22:44,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:22:44,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:22:44,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 17:22:44,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 17:22:44,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 17:22:44,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 17:22:44,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 17:22:44,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 17:22:44,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-08 17:22:44,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-08 17:22:44,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-08 17:22:44,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-08 17:22:44,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-08 17:22:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-08 17:22:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-08 17:22:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-08 17:22:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:22:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:22:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:22:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 17:22:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 17:22:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 17:22:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 17:22:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-08 17:22:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-08 17:22:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-08 17:22:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-08 17:22:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-08 17:22:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-08 17:22:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-08 17:22:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 17:22:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 17:22:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 17:22:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 17:22:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 17:22:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 17:22:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-08 17:22:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-08 17:22:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-08 17:22:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-08 17:22:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-08 17:22:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-08 17:22:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-08 17:22:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-08 17:22:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:22:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:22:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:22:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 17:22:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 17:22:44,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 17:22:44,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 17:22:44,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-08 17:22:44,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-08 17:22:44,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-08 17:22:44,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-08 17:22:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-08 17:22:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-08 17:22:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-08 17:22:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 17:22:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 17:22:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 17:22:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 17:22:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 17:22:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 17:22:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-08 17:22:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-08 17:22:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-08 17:22:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-08 17:22:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-08 17:22:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-08 17:22:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-08 17:22:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-08 17:22:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:22:44,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:22:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:22:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:22:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:22:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 17:22:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 17:22:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 17:22:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 17:22:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-08 17:22:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-08 17:22:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-08 17:22:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-08 17:22:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-08 17:22:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-08 17:22:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-08 17:22:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:22:44,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:22:45,320 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:22:45,322 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:22:46,163 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-08 17:22:46,163 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:22:46,183 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:22:46,184 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:22:46,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:22:46 BoogieIcfgContainer [2024-11-08 17:22:46,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:22:46,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:22:46,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:22:46,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:22:46,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:22:43" (1/3) ... [2024-11-08 17:22:46,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44477199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:22:46, skipping insertion in model container [2024-11-08 17:22:46,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:22:44" (2/3) ... [2024-11-08 17:22:46,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44477199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:22:46, skipping insertion in model container [2024-11-08 17:22:46,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:22:46" (3/3) ... [2024-11-08 17:22:46,203 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-4.i [2024-11-08 17:22:46,233 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:22:46,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:22:46,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:22:46,340 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;@694db38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:22:46,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:22:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:22:46,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 17:22:46,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:46,361 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:46,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:22:46,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1170486752, now seen corresponding path program 1 times [2024-11-08 17:22:46,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:46,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883328281] [2024-11-08 17:22:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:46,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:22:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:22:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:22:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:22:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:22:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:22:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:22:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:22:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:22:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:22:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:22:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:22:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:22:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:22:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:22:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:22:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883328281] [2024-11-08 17:22:47,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883328281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:47,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:22:47,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182385118] [2024-11-08 17:22:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:47,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:22:47,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:47,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:22:47,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:22:47,182 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 17:22:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:47,244 INFO L93 Difference]: Finished difference Result 213 states and 331 transitions. [2024-11-08 17:22:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:22:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-08 17:22:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:47,263 INFO L225 Difference]: With dead ends: 213 [2024-11-08 17:22:47,263 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 17:22:47,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:22:47,273 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:47,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:22:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 17:22:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-08 17:22:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:22:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-08 17:22:47,350 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2024-11-08 17:22:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:47,353 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-08 17:22:47,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 17:22:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-08 17:22:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 17:22:47,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:47,358 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:47,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:22:47,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:22:47,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1675110542, now seen corresponding path program 1 times [2024-11-08 17:22:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:47,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167353809] [2024-11-08 17:22:47,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:47,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:22:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:22:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:22:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:22:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:22:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:22:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:22:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:22:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:22:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:22:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:22:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:22:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:22:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:22:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:22:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:22:47,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:47,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167353809] [2024-11-08 17:22:47,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167353809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:47,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:47,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:22:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866824715] [2024-11-08 17:22:47,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:22:47,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:48,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:22:48,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:48,001 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:22:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:48,077 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2024-11-08 17:22:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:22:48,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 17:22:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:48,081 INFO L225 Difference]: With dead ends: 212 [2024-11-08 17:22:48,081 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 17:22:48,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:48,084 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:48,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:22:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 17:22:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-08 17:22:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:22:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-08 17:22:48,102 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2024-11-08 17:22:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:48,104 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-08 17:22:48,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:22:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-08 17:22:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 17:22:48,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:48,109 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:48,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:22:48,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:22:48,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1673263500, now seen corresponding path program 1 times [2024-11-08 17:22:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:48,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419791664] [2024-11-08 17:22:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:22:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:22:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:22:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:22:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:22:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:22:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:22:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:22:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:22:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:22:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:22:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:22:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:22:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:22:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:22:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:22:49,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419791664] [2024-11-08 17:22:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419791664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:49,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:49,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:22:49,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711648182] [2024-11-08 17:22:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:49,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:22:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:49,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:22:49,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:22:49,495 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:22:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:49,713 INFO L93 Difference]: Finished difference Result 283 states and 412 transitions. [2024-11-08 17:22:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:22:49,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 17:22:49,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:49,717 INFO L225 Difference]: With dead ends: 283 [2024-11-08 17:22:49,717 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 17:22:49,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:22:49,724 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 148 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:49,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 814 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:22:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 17:22:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 110. [2024-11-08 17:22:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:22:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-08 17:22:49,766 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 130 [2024-11-08 17:22:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:49,767 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-08 17:22:49,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:22:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-08 17:22:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 17:22:49,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:49,775 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:49,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:22:49,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:22:49,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash -972198922, now seen corresponding path program 1 times [2024-11-08 17:22:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:49,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947135699] [2024-11-08 17:22:49,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:49,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:22:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:22:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:22:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:22:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:22:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:22:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:22:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:22:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:22:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:22:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:22:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:22:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:22:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:22:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:22:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:22:50,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:50,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947135699] [2024-11-08 17:22:50,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947135699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:50,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:50,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:22:50,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249285642] [2024-11-08 17:22:50,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:50,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:22:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:50,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:22:50,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:50,233 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:22:50,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:50,279 INFO L93 Difference]: Finished difference Result 219 states and 316 transitions. [2024-11-08 17:22:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:22:50,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 17:22:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:50,282 INFO L225 Difference]: With dead ends: 219 [2024-11-08 17:22:50,285 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 17:22:50,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:22:50,288 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:50,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:22:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 17:22:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-08 17:22:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:22:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-08 17:22:50,311 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 130 [2024-11-08 17:22:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:50,312 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-08 17:22:50,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:22:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-08 17:22:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 17:22:50,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:50,320 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:50,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:22:50,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:22:50,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:50,321 INFO L85 PathProgramCache]: Analyzing trace with hash -544821784, now seen corresponding path program 1 times [2024-11-08 17:22:50,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:50,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712035884] [2024-11-08 17:22:50,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:50,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:22:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:22:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:22:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:22:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:22:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:22:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:22:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:22:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:22:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:22:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:22:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:22:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:22:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:22:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:22:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:22:50,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:50,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712035884] [2024-11-08 17:22:50,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712035884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:50,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:50,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:22:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907673793] [2024-11-08 17:22:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:50,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:22:50,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:50,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:22:50,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:22:50,791 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:22:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:50,846 INFO L93 Difference]: Finished difference Result 224 states and 321 transitions. [2024-11-08 17:22:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:22:50,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-08 17:22:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:50,850 INFO L225 Difference]: With dead ends: 224 [2024-11-08 17:22:50,850 INFO L226 Difference]: Without dead ends: 115 [2024-11-08 17:22:50,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:22:50,854 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:50,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:22:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-08 17:22:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-11-08 17:22:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:22:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-08 17:22:50,877 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 132 [2024-11-08 17:22:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:50,878 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-08 17:22:50,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:22:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-08 17:22:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:22:50,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:50,885 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:50,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:22:50,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:22:50,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1665782451, now seen corresponding path program 1 times [2024-11-08 17:22:50,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:50,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923751720] [2024-11-08 17:22:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:22:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:22:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:22:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:22:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:22:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:22:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:22:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:22:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:22:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:22:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:22:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:22:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:22:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:22:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:22:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:22:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923751720] [2024-11-08 17:22:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923751720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:52,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:52,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:22:52,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850644766] [2024-11-08 17:22:52,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:52,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:22:52,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:22:52,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:22:52,852 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:22:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:53,992 INFO L93 Difference]: Finished difference Result 351 states and 499 transitions. [2024-11-08 17:22:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:22:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 17:22:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:53,997 INFO L225 Difference]: With dead ends: 351 [2024-11-08 17:22:53,997 INFO L226 Difference]: Without dead ends: 241 [2024-11-08 17:22:53,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:22:53,999 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 428 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:54,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 815 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:22:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-08 17:22:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 175. [2024-11-08 17:22:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.355263157894737) internal successors, (206), 153 states have internal predecessors, (206), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:22:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 246 transitions. [2024-11-08 17:22:54,028 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 246 transitions. Word has length 134 [2024-11-08 17:22:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:54,029 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 246 transitions. [2024-11-08 17:22:54,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:22:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 246 transitions. [2024-11-08 17:22:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:22:54,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:54,032 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:54,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:22:54,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:22:54,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1349321167, now seen corresponding path program 1 times [2024-11-08 17:22:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:54,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608194099] [2024-11-08 17:22:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:22:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:22:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:22:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:22:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:22:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:22:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:22:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:22:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:22:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:22:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:22:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:22:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:22:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:22:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:22:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:22:55,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:55,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608194099] [2024-11-08 17:22:55,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608194099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:55,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:55,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:22:55,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325972664] [2024-11-08 17:22:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:55,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:22:55,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:55,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:22:55,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:22:55,679 INFO L87 Difference]: Start difference. First operand 175 states and 246 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:22:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:55,933 INFO L93 Difference]: Finished difference Result 407 states and 568 transitions. [2024-11-08 17:22:55,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:22:55,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:22:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:55,939 INFO L225 Difference]: With dead ends: 407 [2024-11-08 17:22:55,939 INFO L226 Difference]: Without dead ends: 235 [2024-11-08 17:22:55,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:22:55,945 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 36 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:55,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 555 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:22:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-08 17:22:55,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 179. [2024-11-08 17:22:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 157 states have internal predecessors, (210), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:22:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 250 transitions. [2024-11-08 17:22:55,973 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 250 transitions. Word has length 134 [2024-11-08 17:22:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:55,974 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 250 transitions. [2024-11-08 17:22:55,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:22:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 250 transitions. [2024-11-08 17:22:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:22:55,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:55,977 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:55,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:22:55,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:22:55,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1928292171, now seen corresponding path program 1 times [2024-11-08 17:22:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:22:55,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602937344] [2024-11-08 17:22:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:55,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:22:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:22:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:22:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:22:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:22:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:22:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:22:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:22:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:22:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:22:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:22:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:22:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:22:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:22:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:22:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:22:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:22:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:22:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602937344] [2024-11-08 17:22:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602937344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:59,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:22:59,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:22:59,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642628966] [2024-11-08 17:22:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:59,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:22:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:22:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:22:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:22:59,763 INFO L87 Difference]: Start difference. First operand 179 states and 250 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:03,828 INFO L93 Difference]: Finished difference Result 402 states and 561 transitions. [2024-11-08 17:23:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:23:03,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:23:03,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:03,833 INFO L225 Difference]: With dead ends: 402 [2024-11-08 17:23:03,833 INFO L226 Difference]: Without dead ends: 226 [2024-11-08 17:23:03,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:23:03,835 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 360 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:03,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 499 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 17:23:03,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-08 17:23:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 205. [2024-11-08 17:23:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 182 states have (on average 1.3461538461538463) internal successors, (245), 183 states have internal predecessors, (245), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:23:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 285 transitions. [2024-11-08 17:23:03,883 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 285 transitions. Word has length 134 [2024-11-08 17:23:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:03,885 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 285 transitions. [2024-11-08 17:23:03,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 285 transitions. [2024-11-08 17:23:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:23:03,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:03,890 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:03,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:23:03,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:03,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1966245246, now seen corresponding path program 1 times [2024-11-08 17:23:03,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:03,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301082448] [2024-11-08 17:23:03,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:05,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:05,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301082448] [2024-11-08 17:23:05,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301082448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:05,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:05,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:23:05,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299995691] [2024-11-08 17:23:05,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:05,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:23:05,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:23:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:23:05,266 INFO L87 Difference]: Start difference. First operand 205 states and 285 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:05,837 INFO L93 Difference]: Finished difference Result 414 states and 574 transitions. [2024-11-08 17:23:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:23:05,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:23:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:05,840 INFO L225 Difference]: With dead ends: 414 [2024-11-08 17:23:05,841 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 17:23:05,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:23:05,843 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 69 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:05,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1289 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:23:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 17:23:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2024-11-08 17:23:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 186 states have (on average 1.3387096774193548) internal successors, (249), 187 states have internal predecessors, (249), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:23:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 289 transitions. [2024-11-08 17:23:05,883 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 289 transitions. Word has length 134 [2024-11-08 17:23:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:05,884 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 289 transitions. [2024-11-08 17:23:05,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 289 transitions. [2024-11-08 17:23:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:23:05,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:05,886 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:05,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:23:05,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:05,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:05,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1265180668, now seen corresponding path program 1 times [2024-11-08 17:23:05,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:05,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5165150] [2024-11-08 17:23:05,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:05,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5165150] [2024-11-08 17:23:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5165150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:07,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:23:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386334060] [2024-11-08 17:23:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:07,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:23:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:07,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:23:07,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:23:07,219 INFO L87 Difference]: Start difference. First operand 209 states and 289 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:07,822 INFO L93 Difference]: Finished difference Result 419 states and 577 transitions. [2024-11-08 17:23:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:23:07,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 17:23:07,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:07,826 INFO L225 Difference]: With dead ends: 419 [2024-11-08 17:23:07,826 INFO L226 Difference]: Without dead ends: 213 [2024-11-08 17:23:07,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:23:07,828 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 395 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:07,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 622 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:23:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-08 17:23:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-11-08 17:23:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 187 states have (on average 1.3315508021390374) internal successors, (249), 188 states have internal predecessors, (249), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:23:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 289 transitions. [2024-11-08 17:23:07,864 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 289 transitions. Word has length 134 [2024-11-08 17:23:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:07,865 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 289 transitions. [2024-11-08 17:23:07,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 289 transitions. [2024-11-08 17:23:07,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:23:07,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:07,868 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:07,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:23:07,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:07,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:07,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1825696636, now seen corresponding path program 1 times [2024-11-08 17:23:07,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:07,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973273897] [2024-11-08 17:23:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:07,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:08,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:08,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973273897] [2024-11-08 17:23:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973273897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:08,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:08,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:23:08,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546913583] [2024-11-08 17:23:08,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:08,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:23:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:23:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:23:08,963 INFO L87 Difference]: Start difference. First operand 211 states and 289 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:09,552 INFO L93 Difference]: Finished difference Result 451 states and 615 transitions. [2024-11-08 17:23:09,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:23:09,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 17:23:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:09,558 INFO L225 Difference]: With dead ends: 451 [2024-11-08 17:23:09,559 INFO L226 Difference]: Without dead ends: 243 [2024-11-08 17:23:09,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:23:09,561 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 341 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:09,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 705 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:23:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-08 17:23:09,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2024-11-08 17:23:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 212 states have (on average 1.320754716981132) internal successors, (280), 214 states have internal predecessors, (280), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 17:23:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 326 transitions. [2024-11-08 17:23:09,641 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 326 transitions. Word has length 134 [2024-11-08 17:23:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:09,642 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 326 transitions. [2024-11-08 17:23:09,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 326 transitions. [2024-11-08 17:23:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:23:09,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:09,645 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:09,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:23:09,645 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:09,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1124632058, now seen corresponding path program 1 times [2024-11-08 17:23:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:09,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617770971] [2024-11-08 17:23:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:11,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617770971] [2024-11-08 17:23:11,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617770971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:11,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:11,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:23:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446412221] [2024-11-08 17:23:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:11,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:23:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:23:11,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:23:11,589 INFO L87 Difference]: Start difference. First operand 240 states and 326 transitions. Second operand has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:12,893 INFO L93 Difference]: Finished difference Result 482 states and 654 transitions. [2024-11-08 17:23:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:23:12,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 17:23:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:12,898 INFO L225 Difference]: With dead ends: 482 [2024-11-08 17:23:12,901 INFO L226 Difference]: Without dead ends: 245 [2024-11-08 17:23:12,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:23:12,903 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 326 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:12,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1461 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:23:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-08 17:23:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2024-11-08 17:23:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 214 states have (on average 1.3177570093457944) internal successors, (282), 216 states have internal predecessors, (282), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 17:23:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 328 transitions. [2024-11-08 17:23:12,949 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 328 transitions. Word has length 134 [2024-11-08 17:23:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:12,950 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 328 transitions. [2024-11-08 17:23:12,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 328 transitions. [2024-11-08 17:23:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:23:12,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:12,954 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:12,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:23:12,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:12,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:12,955 INFO L85 PathProgramCache]: Analyzing trace with hash -527777708, now seen corresponding path program 1 times [2024-11-08 17:23:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812834185] [2024-11-08 17:23:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:14,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:14,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:14,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:14,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:14,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812834185] [2024-11-08 17:23:14,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812834185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:14,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:14,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:23:14,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445328090] [2024-11-08 17:23:14,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:14,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:23:14,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:14,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:23:14,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:23:14,034 INFO L87 Difference]: Start difference. First operand 242 states and 328 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:14,671 INFO L93 Difference]: Finished difference Result 559 states and 755 transitions. [2024-11-08 17:23:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:23:14,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:23:14,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:14,676 INFO L225 Difference]: With dead ends: 559 [2024-11-08 17:23:14,677 INFO L226 Difference]: Without dead ends: 320 [2024-11-08 17:23:14,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:23:14,679 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 70 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:14,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1441 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:23:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-08 17:23:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 277. [2024-11-08 17:23:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 249 states have (on average 1.3293172690763053) internal successors, (331), 251 states have internal predecessors, (331), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 17:23:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 377 transitions. [2024-11-08 17:23:14,731 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 377 transitions. Word has length 134 [2024-11-08 17:23:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:14,734 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 377 transitions. [2024-11-08 17:23:14,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 377 transitions. [2024-11-08 17:23:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:23:14,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:14,737 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:14,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:23:14,739 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:14,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash 173286870, now seen corresponding path program 1 times [2024-11-08 17:23:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496845962] [2024-11-08 17:23:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:15,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:15,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496845962] [2024-11-08 17:23:15,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496845962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:15,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:15,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:23:15,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198278769] [2024-11-08 17:23:15,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:15,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:23:15,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:15,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:23:15,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:23:15,293 INFO L87 Difference]: Start difference. First operand 277 states and 377 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:15,582 INFO L93 Difference]: Finished difference Result 582 states and 789 transitions. [2024-11-08 17:23:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:23:15,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:23:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:15,585 INFO L225 Difference]: With dead ends: 582 [2024-11-08 17:23:15,586 INFO L226 Difference]: Without dead ends: 308 [2024-11-08 17:23:15,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:23:15,588 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 61 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:15,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 690 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:23:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-08 17:23:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 276. [2024-11-08 17:23:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 248 states have (on average 1.3266129032258065) internal successors, (329), 250 states have internal predecessors, (329), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 17:23:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 375 transitions. [2024-11-08 17:23:15,643 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 375 transitions. Word has length 134 [2024-11-08 17:23:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:15,644 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 375 transitions. [2024-11-08 17:23:15,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 375 transitions. [2024-11-08 17:23:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:23:15,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:15,647 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:15,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:23:15,647 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:15,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash -127347829, now seen corresponding path program 1 times [2024-11-08 17:23:15,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:15,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825999894] [2024-11-08 17:23:15,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:17,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:17,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825999894] [2024-11-08 17:23:17,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825999894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:17,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:23:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688190040] [2024-11-08 17:23:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:17,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:23:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:17,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:23:17,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:23:17,923 INFO L87 Difference]: Start difference. First operand 276 states and 375 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:19,533 INFO L93 Difference]: Finished difference Result 565 states and 766 transitions. [2024-11-08 17:23:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:23:19,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:23:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:19,537 INFO L225 Difference]: With dead ends: 565 [2024-11-08 17:23:19,538 INFO L226 Difference]: Without dead ends: 292 [2024-11-08 17:23:19,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:23:19,539 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 263 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:19,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 610 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:23:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-08 17:23:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 271. [2024-11-08 17:23:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 243 states have (on average 1.316872427983539) internal successors, (320), 245 states have internal predecessors, (320), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 17:23:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 366 transitions. [2024-11-08 17:23:19,588 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 366 transitions. Word has length 134 [2024-11-08 17:23:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:19,589 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 366 transitions. [2024-11-08 17:23:19,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 366 transitions. [2024-11-08 17:23:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:23:19,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:19,591 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:19,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:23:19,592 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:19,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash -387229098, now seen corresponding path program 1 times [2024-11-08 17:23:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995502919] [2024-11-08 17:23:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995502919] [2024-11-08 17:23:20,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995502919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:20,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:23:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379702730] [2024-11-08 17:23:20,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:20,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:23:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:20,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:23:20,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:23:20,426 INFO L87 Difference]: Start difference. First operand 271 states and 366 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:20,971 INFO L93 Difference]: Finished difference Result 557 states and 747 transitions. [2024-11-08 17:23:20,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:23:20,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 17:23:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:20,975 INFO L225 Difference]: With dead ends: 557 [2024-11-08 17:23:20,975 INFO L226 Difference]: Without dead ends: 289 [2024-11-08 17:23:20,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:23:20,976 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 209 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:20,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 707 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:23:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-08 17:23:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 249. [2024-11-08 17:23:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 224 states have (on average 1.3125) internal successors, (294), 225 states have internal predecessors, (294), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:23:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 334 transitions. [2024-11-08 17:23:21,020 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 334 transitions. Word has length 134 [2024-11-08 17:23:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:21,021 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 334 transitions. [2024-11-08 17:23:21,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 334 transitions. [2024-11-08 17:23:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:23:21,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:21,024 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:21,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:23:21,024 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:21,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash 313835480, now seen corresponding path program 1 times [2024-11-08 17:23:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:21,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542630879] [2024-11-08 17:23:21,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:21,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:22,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542630879] [2024-11-08 17:23:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542630879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:22,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:23:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903918294] [2024-11-08 17:23:22,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:22,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:23:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:22,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:23:22,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:23:22,706 INFO L87 Difference]: Start difference. First operand 249 states and 334 transitions. Second operand has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:24,140 INFO L93 Difference]: Finished difference Result 534 states and 713 transitions. [2024-11-08 17:23:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:23:24,141 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-08 17:23:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:24,143 INFO L225 Difference]: With dead ends: 534 [2024-11-08 17:23:24,143 INFO L226 Difference]: Without dead ends: 288 [2024-11-08 17:23:24,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:23:24,145 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 309 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:24,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1658 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:23:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-08 17:23:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 248. [2024-11-08 17:23:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 223 states have (on average 1.3139013452914798) internal successors, (293), 224 states have internal predecessors, (293), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:23:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 333 transitions. [2024-11-08 17:23:24,188 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 333 transitions. Word has length 134 [2024-11-08 17:23:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:24,189 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 333 transitions. [2024-11-08 17:23:24,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 333 transitions. [2024-11-08 17:23:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 17:23:24,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:24,192 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:24,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:23:24,192 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:24,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:24,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1444027400, now seen corresponding path program 1 times [2024-11-08 17:23:24,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:24,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683230504] [2024-11-08 17:23:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:24,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:24,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683230504] [2024-11-08 17:23:25,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683230504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:25,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:25,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:23:25,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261935233] [2024-11-08 17:23:25,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:25,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:23:25,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:25,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:23:25,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:23:25,087 INFO L87 Difference]: Start difference. First operand 248 states and 333 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:25,545 INFO L93 Difference]: Finished difference Result 571 states and 758 transitions. [2024-11-08 17:23:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:23:25,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-08 17:23:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:25,549 INFO L225 Difference]: With dead ends: 571 [2024-11-08 17:23:25,549 INFO L226 Difference]: Without dead ends: 326 [2024-11-08 17:23:25,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:23:25,551 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 248 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:25,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 599 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:23:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-08 17:23:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 260. [2024-11-08 17:23:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 236 states have internal predecessors, (309), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:23:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 349 transitions. [2024-11-08 17:23:25,594 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 349 transitions. Word has length 135 [2024-11-08 17:23:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:25,595 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 349 transitions. [2024-11-08 17:23:25,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 349 transitions. [2024-11-08 17:23:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:23:25,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:25,598 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:25,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:23:25,599 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:25,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:25,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1452553465, now seen corresponding path program 1 times [2024-11-08 17:23:25,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:25,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763780360] [2024-11-08 17:23:25,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:25,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:26,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:26,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763780360] [2024-11-08 17:23:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763780360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:26,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:26,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:23:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727888359] [2024-11-08 17:23:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:26,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:23:26,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:26,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:23:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:23:26,455 INFO L87 Difference]: Start difference. First operand 260 states and 349 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:26,746 INFO L93 Difference]: Finished difference Result 288 states and 381 transitions. [2024-11-08 17:23:26,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:23:26,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 17:23:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:26,750 INFO L225 Difference]: With dead ends: 288 [2024-11-08 17:23:26,750 INFO L226 Difference]: Without dead ends: 286 [2024-11-08 17:23:26,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 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:23:26,751 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 56 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:26,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 852 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:23:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-08 17:23:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 243. [2024-11-08 17:23:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 218 states have (on average 1.311926605504587) internal successors, (286), 219 states have internal predecessors, (286), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:23:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 326 transitions. [2024-11-08 17:23:26,812 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 326 transitions. Word has length 137 [2024-11-08 17:23:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:26,812 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 326 transitions. [2024-11-08 17:23:26,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 326 transitions. [2024-11-08 17:23:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:23:26,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:26,815 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:23:26,816 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:26,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1450706423, now seen corresponding path program 1 times [2024-11-08 17:23:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:26,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208824216] [2024-11-08 17:23:26,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:28,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:28,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208824216] [2024-11-08 17:23:28,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208824216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:28,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:28,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:23:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461532860] [2024-11-08 17:23:28,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:28,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:23:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:23:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:23:28,546 INFO L87 Difference]: Start difference. First operand 243 states and 326 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:29,234 INFO L93 Difference]: Finished difference Result 616 states and 821 transitions. [2024-11-08 17:23:29,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:23:29,235 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-08 17:23:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:29,238 INFO L225 Difference]: With dead ends: 616 [2024-11-08 17:23:29,238 INFO L226 Difference]: Without dead ends: 391 [2024-11-08 17:23:29,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:23:29,239 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 243 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:29,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 917 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:23:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-08 17:23:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 363. [2024-11-08 17:23:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 338 states have (on average 1.3136094674556213) internal successors, (444), 339 states have internal predecessors, (444), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 17:23:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 484 transitions. [2024-11-08 17:23:29,288 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 484 transitions. Word has length 137 [2024-11-08 17:23:29,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:29,288 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 484 transitions. [2024-11-08 17:23:29,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 484 transitions. [2024-11-08 17:23:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:23:29,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:29,292 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:29,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:23:29,292 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:29,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1380698547, now seen corresponding path program 1 times [2024-11-08 17:23:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:29,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841205324] [2024-11-08 17:23:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:30,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:30,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841205324] [2024-11-08 17:23:30,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841205324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:30,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:30,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:23:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486350675] [2024-11-08 17:23:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:30,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:23:30,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:30,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:23:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:23:30,135 INFO L87 Difference]: Start difference. First operand 363 states and 484 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:30,899 INFO L93 Difference]: Finished difference Result 980 states and 1302 transitions. [2024-11-08 17:23:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:23:30,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 17:23:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:30,905 INFO L225 Difference]: With dead ends: 980 [2024-11-08 17:23:30,905 INFO L226 Difference]: Without dead ends: 633 [2024-11-08 17:23:30,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:23:30,907 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 240 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:30,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1167 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:23:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-08 17:23:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 517. [2024-11-08 17:23:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 474 states have (on average 1.2890295358649788) internal successors, (611), 476 states have internal predecessors, (611), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 17:23:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 681 transitions. [2024-11-08 17:23:30,991 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 681 transitions. Word has length 137 [2024-11-08 17:23:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:30,993 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 681 transitions. [2024-11-08 17:23:30,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 681 transitions. [2024-11-08 17:23:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:23:30,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:30,997 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:30,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:23:30,997 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:30,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash 563050097, now seen corresponding path program 1 times [2024-11-08 17:23:30,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:30,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356830155] [2024-11-08 17:23:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:32,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356830155] [2024-11-08 17:23:32,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356830155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:32,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:32,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:23:32,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986873247] [2024-11-08 17:23:32,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:32,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:23:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:32,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:23:32,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:23:32,250 INFO L87 Difference]: Start difference. First operand 517 states and 681 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:32,933 INFO L93 Difference]: Finished difference Result 1361 states and 1787 transitions. [2024-11-08 17:23:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:23:32,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 17:23:32,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:32,943 INFO L225 Difference]: With dead ends: 1361 [2024-11-08 17:23:32,946 INFO L226 Difference]: Without dead ends: 862 [2024-11-08 17:23:32,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:23:32,948 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 147 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:32,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 2004 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:23:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-11-08 17:23:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 515. [2024-11-08 17:23:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 472 states have (on average 1.2944915254237288) internal successors, (611), 474 states have internal predecessors, (611), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 17:23:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 681 transitions. [2024-11-08 17:23:33,050 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 681 transitions. Word has length 137 [2024-11-08 17:23:33,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:33,050 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 681 transitions. [2024-11-08 17:23:33,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 681 transitions. [2024-11-08 17:23:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:23:33,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:33,056 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:33,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:23:33,056 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:33,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2143878161, now seen corresponding path program 1 times [2024-11-08 17:23:33,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:33,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691462935] [2024-11-08 17:23:33,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:33,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:34,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:34,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691462935] [2024-11-08 17:23:34,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691462935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:34,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:34,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:23:34,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636250827] [2024-11-08 17:23:34,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:34,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:23:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:34,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:23:34,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:23:34,928 INFO L87 Difference]: Start difference. First operand 515 states and 681 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:36,574 INFO L93 Difference]: Finished difference Result 1330 states and 1743 transitions. [2024-11-08 17:23:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:23:36,576 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 17:23:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:36,581 INFO L225 Difference]: With dead ends: 1330 [2024-11-08 17:23:36,581 INFO L226 Difference]: Without dead ends: 833 [2024-11-08 17:23:36,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:23:36,584 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 289 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:36,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 2929 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:23:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2024-11-08 17:23:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 435. [2024-11-08 17:23:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 399 states have (on average 1.3258145363408522) internal successors, (529), 400 states have internal predecessors, (529), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:23:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 589 transitions. [2024-11-08 17:23:36,668 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 589 transitions. Word has length 137 [2024-11-08 17:23:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:36,669 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 589 transitions. [2024-11-08 17:23:36,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 589 transitions. [2024-11-08 17:23:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:23:36,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:36,672 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:36,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:23:36,673 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1333440685, now seen corresponding path program 1 times [2024-11-08 17:23:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:36,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585529274] [2024-11-08 17:23:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:37,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:37,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585529274] [2024-11-08 17:23:37,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585529274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:37,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:37,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:23:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513717848] [2024-11-08 17:23:37,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:37,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:23:37,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:37,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:23:37,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:23:37,187 INFO L87 Difference]: Start difference. First operand 435 states and 589 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:37,596 INFO L93 Difference]: Finished difference Result 961 states and 1273 transitions. [2024-11-08 17:23:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:23:37,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 17:23:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:37,601 INFO L225 Difference]: With dead ends: 961 [2024-11-08 17:23:37,602 INFO L226 Difference]: Without dead ends: 588 [2024-11-08 17:23:37,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:23:37,604 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 129 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:37,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 616 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:23:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-08 17:23:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 423. [2024-11-08 17:23:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 387 states have (on average 1.310077519379845) internal successors, (507), 388 states have internal predecessors, (507), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:23:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 567 transitions. [2024-11-08 17:23:37,692 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 567 transitions. Word has length 137 [2024-11-08 17:23:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:37,693 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 567 transitions. [2024-11-08 17:23:37,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 567 transitions. [2024-11-08 17:23:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:23:37,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:37,695 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:37,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 17:23:37,696 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:37,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:37,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1665787914, now seen corresponding path program 1 times [2024-11-08 17:23:37,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:37,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227655021] [2024-11-08 17:23:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:37,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:38,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:38,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227655021] [2024-11-08 17:23:38,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227655021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:38,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:38,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:23:38,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820418814] [2024-11-08 17:23:38,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:38,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:23:38,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:38,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:23:38,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:23:38,907 INFO L87 Difference]: Start difference. First operand 423 states and 567 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:40,481 INFO L93 Difference]: Finished difference Result 986 states and 1305 transitions. [2024-11-08 17:23:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:23:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-08 17:23:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:40,489 INFO L225 Difference]: With dead ends: 986 [2024-11-08 17:23:40,489 INFO L226 Difference]: Without dead ends: 625 [2024-11-08 17:23:40,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:23:40,491 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 401 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:40,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1605 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:23:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-08 17:23:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 393. [2024-11-08 17:23:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 357 states have (on average 1.2969187675070029) internal successors, (463), 358 states have internal predecessors, (463), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:23:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 523 transitions. [2024-11-08 17:23:40,591 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 523 transitions. Word has length 137 [2024-11-08 17:23:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:40,592 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 523 transitions. [2024-11-08 17:23:40,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 523 transitions. [2024-11-08 17:23:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:23:40,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:40,594 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:40,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:23:40,595 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:40,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash -793242482, now seen corresponding path program 1 times [2024-11-08 17:23:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:40,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220646463] [2024-11-08 17:23:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:41,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:41,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220646463] [2024-11-08 17:23:41,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220646463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:41,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:41,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:23:41,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812843685] [2024-11-08 17:23:41,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:41,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:23:41,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:23:41,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:23:41,808 INFO L87 Difference]: Start difference. First operand 393 states and 523 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:42,369 INFO L93 Difference]: Finished difference Result 765 states and 1008 transitions. [2024-11-08 17:23:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:23:42,370 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 139 [2024-11-08 17:23:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:42,373 INFO L225 Difference]: With dead ends: 765 [2024-11-08 17:23:42,373 INFO L226 Difference]: Without dead ends: 434 [2024-11-08 17:23:42,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:23:42,375 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 402 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:42,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 709 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:23:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-08 17:23:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 393. [2024-11-08 17:23:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 357 states have (on average 1.2941176470588236) internal successors, (462), 358 states have internal predecessors, (462), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:23:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 522 transitions. [2024-11-08 17:23:42,442 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 522 transitions. Word has length 139 [2024-11-08 17:23:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:42,443 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 522 transitions. [2024-11-08 17:23:42,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-08 17:23:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 522 transitions. [2024-11-08 17:23:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:23:42,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:42,445 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:42,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 17:23:42,446 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:42,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:42,447 INFO L85 PathProgramCache]: Analyzing trace with hash -652693872, now seen corresponding path program 1 times [2024-11-08 17:23:42,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:42,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948541558] [2024-11-08 17:23:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:42,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:23:42,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054655090] [2024-11-08 17:23:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:42,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:23:42,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:23:42,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:23:42,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:23:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:43,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 17:23:43,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:23:44,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 17:23:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-08 17:23:46,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:23:47,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-11-08 17:23:48,006 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_~#var_1_3~0.base| c_~var_1_3_Pointer~0.base)) (.cse4 (= |c_~#var_1_3~0.offset| c_~var_1_3_Pointer~0.offset)) (.cse3 (mod c_~last_1_var_1_12~0 4294967296)) (.cse2 (mod (+ 4294967232 (mod c_~last_1_var_1_18~0 256)) 4294967296))) (and (or (forall ((v_z_2 Int) (v_y_2 Int)) (let ((.cse1 (* v_y_2 4294967296))) (let ((.cse0 (+ .cse1 v_z_2))) (or (= .cse0 0) (< 4294967295 v_z_2) (< (+ .cse1 v_z_2 32768) 0) (not (= .cse2 (div .cse3 v_z_2))) (< 32767 .cse0) (< v_z_2 0))))) (not .cse4) (not .cse5)) (or (and .cse5 .cse4) (forall ((v_z_1 Int)) (or (< v_z_1 0) (< 4294967295 v_z_1) (not (= (mod (div .cse3 v_z_1) 4294967296) .cse2))))))) is different from false [2024-11-08 17:23:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-08 17:23:48,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:48,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948541558] [2024-11-08 17:23:48,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 17:23:48,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054655090] [2024-11-08 17:23:48,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054655090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:23:48,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:23:48,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-11-08 17:23:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927734672] [2024-11-08 17:23:48,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:23:48,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 17:23:48,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 17:23:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=269, Unknown=8, NotChecked=34, Total=380 [2024-11-08 17:23:48,803 INFO L87 Difference]: Start difference. First operand 393 states and 522 transitions. Second operand has 20 states, 18 states have (on average 7.166666666666667) internal successors, (129), 19 states have internal predecessors, (129), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2024-11-08 17:23:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:51,641 INFO L93 Difference]: Finished difference Result 884 states and 1163 transitions. [2024-11-08 17:23:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:23:51,643 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.166666666666667) internal successors, (129), 19 states have internal predecessors, (129), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) Word has length 139 [2024-11-08 17:23:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:51,646 INFO L225 Difference]: With dead ends: 884 [2024-11-08 17:23:51,647 INFO L226 Difference]: Without dead ends: 553 [2024-11-08 17:23:51,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=251, Invalid=675, Unknown=8, NotChecked=58, Total=992 [2024-11-08 17:23:51,649 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 553 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:51,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1554 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 486 Invalid, 0 Unknown, 180 Unchecked, 1.9s Time] [2024-11-08 17:23:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-08 17:23:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 396. [2024-11-08 17:23:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 360 states have (on average 1.2916666666666667) internal successors, (465), 360 states have internal predecessors, (465), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:23:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 525 transitions. [2024-11-08 17:23:51,737 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 525 transitions. Word has length 139 [2024-11-08 17:23:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:51,738 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 525 transitions. [2024-11-08 17:23:51,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.166666666666667) internal successors, (129), 19 states have internal predecessors, (129), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2024-11-08 17:23:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 525 transitions. [2024-11-08 17:23:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:23:51,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:51,740 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:51,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:23:51,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-08 17:23:51,941 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:51,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash 512355260, now seen corresponding path program 1 times [2024-11-08 17:23:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:51,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255072249] [2024-11-08 17:23:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:51,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:23:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:23:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:23:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:23:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:23:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:23:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:23:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:23:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 17:23:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:23:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:23:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:23:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:23:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:23:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:23:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:23:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:23:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:23:52,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255072249] [2024-11-08 17:23:52,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255072249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:23:52,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:23:52,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:23:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43572879] [2024-11-08 17:23:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:23:52,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:23:52,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:23:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:23:52,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:23:52,611 INFO L87 Difference]: Start difference. First operand 396 states and 525 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:23:52,979 INFO L93 Difference]: Finished difference Result 768 states and 1009 transitions. [2024-11-08 17:23:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:23:52,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-08 17:23:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:23:52,985 INFO L225 Difference]: With dead ends: 768 [2024-11-08 17:23:52,985 INFO L226 Difference]: Without dead ends: 437 [2024-11-08 17:23:52,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:23:52,988 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 64 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:23:52,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 623 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:23:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-08 17:23:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 396. [2024-11-08 17:23:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 360 states have (on average 1.288888888888889) internal successors, (464), 360 states have internal predecessors, (464), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:23:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 524 transitions. [2024-11-08 17:23:53,084 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 524 transitions. Word has length 139 [2024-11-08 17:23:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:23:53,084 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 524 transitions. [2024-11-08 17:23:53,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:23:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 524 transitions. [2024-11-08 17:23:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:23:53,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:23:53,087 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:53,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 17:23:53,087 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:23:53,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:23:53,088 INFO L85 PathProgramCache]: Analyzing trace with hash 652903870, now seen corresponding path program 1 times [2024-11-08 17:23:53,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:23:53,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945644077] [2024-11-08 17:23:53,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:53,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:23:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:23:53,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355938887] [2024-11-08 17:23:53,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:23:53,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:23:53,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:23:53,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:23:53,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:23:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:23:54,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:23:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:23:54,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:23:54,726 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:23:54,727 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:23:54,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 17:23:54,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-08 17:23:54,936 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:23:55,172 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:23:55,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:23:55 BoogieIcfgContainer [2024-11-08 17:23:55,176 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:23:55,177 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:23:55,177 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:23:55,177 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:23:55,178 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:22:46" (3/4) ... [2024-11-08 17:23:55,181 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:23:55,183 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:23:55,184 INFO L158 Benchmark]: Toolchain (without parser) took 71198.71ms. Allocated memory was 172.0MB in the beginning and 723.5MB in the end (delta: 551.6MB). Free memory was 142.7MB in the beginning and 401.5MB in the end (delta: -258.8MB). Peak memory consumption was 292.7MB. Max. memory is 16.1GB. [2024-11-08 17:23:55,184 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:23:55,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.03ms. Allocated memory is still 172.0MB. Free memory was 142.7MB in the beginning and 126.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 17:23:55,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.02ms. Allocated memory is still 172.0MB. Free memory was 126.4MB in the beginning and 122.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:23:55,185 INFO L158 Benchmark]: Boogie Preprocessor took 107.72ms. Allocated memory is still 172.0MB. Free memory was 122.2MB in the beginning and 115.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 17:23:55,186 INFO L158 Benchmark]: RCFGBuilder took 1449.78ms. Allocated memory is still 172.0MB. Free memory was 115.9MB in the beginning and 101.0MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:23:55,186 INFO L158 Benchmark]: TraceAbstraction took 68986.45ms. Allocated memory was 172.0MB in the beginning and 723.5MB in the end (delta: 551.6MB). Free memory was 100.8MB in the beginning and 402.6MB in the end (delta: -301.8MB). Peak memory consumption was 252.9MB. Max. memory is 16.1GB. [2024-11-08 17:23:55,187 INFO L158 Benchmark]: Witness Printer took 6.35ms. Allocated memory is still 723.5MB. Free memory was 402.6MB in the beginning and 401.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:23:55,189 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.43ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.03ms. Allocated memory is still 172.0MB. Free memory was 142.7MB in the beginning and 126.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.02ms. Allocated memory is still 172.0MB. Free memory was 126.4MB in the beginning and 122.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.72ms. Allocated memory is still 172.0MB. Free memory was 122.2MB in the beginning and 115.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1449.78ms. Allocated memory is still 172.0MB. Free memory was 115.9MB in the beginning and 101.0MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 68986.45ms. Allocated memory was 172.0MB in the beginning and 723.5MB in the end (delta: 551.6MB). Free memory was 100.8MB in the beginning and 402.6MB in the end (delta: -301.8MB). Peak memory consumption was 252.9MB. Max. memory is 16.1GB. * Witness Printer took 6.35ms. Allocated memory is still 723.5MB. Free memory was 402.6MB in the beginning and 401.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 5; [L22] unsigned short int var_1_1 = 5; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_3 = -25; [L24] signed short int var_1_3 = -25; [L25] signed short int* var_1_3_Pointer = &(var_1_3); [L26] unsigned short int var_1_7 = 4; [L26] unsigned short int var_1_7 = 4; [L27] unsigned short int* var_1_7_Pointer = &(var_1_7); [L28] unsigned char var_1_8 = 4; [L28] unsigned char var_1_8 = 4; [L29] unsigned char* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_10 = 4; [L30] unsigned char var_1_10 = 4; [L31] unsigned char* var_1_10_Pointer = &(var_1_10); [L32] unsigned char var_1_11 = 8; [L32] unsigned char var_1_11 = 8; [L33] unsigned char* var_1_11_Pointer = &(var_1_11); [L34] unsigned long int var_1_12 = 10; [L34] unsigned long int var_1_12 = 10; [L35] unsigned long int* var_1_12_Pointer = &(var_1_12); [L36] float var_1_13 = 99.6; [L36] float var_1_13 = 99.6; [L37] float* var_1_13_Pointer = &(var_1_13); [L38] float var_1_14 = 127.5; [L38] float var_1_14 = 127.5; [L39] float* var_1_14_Pointer = &(var_1_14); [L40] float var_1_15 = 16.5; [L40] float var_1_15 = 16.5; [L41] float* var_1_15_Pointer = &(var_1_15); [L42] float var_1_16 = 256.5; [L42] float var_1_16 = 256.5; [L43] float* var_1_16_Pointer = &(var_1_16); [L44] unsigned long int var_1_17 = 4288034294; [L44] unsigned long int var_1_17 = 4288034294; [L45] unsigned long int* var_1_17_Pointer = &(var_1_17); [L46] unsigned char var_1_18 = 0; [L46] unsigned char var_1_18 = 0; [L47] unsigned char* var_1_18_Pointer = &(var_1_18); [L48] unsigned long int last_1_var_1_12 = 10; [L49] unsigned char last_1_var_1_18 = 0; VAL [isInitial=0, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR \read(var_1_12) [L100] last_1_var_1_12 = var_1_12 [L101] EXPR \read(var_1_18) [L101] last_1_var_1_18 = var_1_18 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L75] var_1_3 = __VERIFIER_nondet_short() [L76] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L76] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L76] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L79] var_1_10 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L80] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L80] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L82] var_1_11 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L83] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L83] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L85] var_1_13 = __VERIFIER_nondet_float() [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L87] var_1_14 = __VERIFIER_nondet_float() [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L89] var_1_15 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L92] var_1_16 = __VERIFIER_nondet_float() [L93] EXPR \read(var_1_16) [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F [L93] EXPR \read(var_1_16) [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR (var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR (var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L95] var_1_17 = __VERIFIER_nondet_ulong() [L96] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L96] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L96] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L112] RET updateVariables() [L113] CALL step() [L53] EXPR \read(*var_1_3_Pointer) [L53] unsigned long int stepLocal_2 = last_1_var_1_12 / (*(var_1_3_Pointer)); [L54] COND TRUE stepLocal_2 != (last_1_var_1_18 - 64) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L55] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L55] (*(var_1_8_Pointer)) = (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))) [L59] EXPR \read(*var_1_13_Pointer) [L59] EXPR \read(*var_1_14_Pointer) [L59] EXPR \read(*var_1_15_Pointer) [L59] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L59] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) [L59] EXPR \read(*var_1_16_Pointer) [L59] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L59] COND TRUE (- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer)))))) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L60] EXPR (((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer))) [L60] EXPR \read(*var_1_8_Pointer) [L60] EXPR (((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L60] (*(var_1_12_Pointer)) = (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))) [L64] EXPR \read(*var_1_11_Pointer) [L64] (*(var_1_18_Pointer)) = (*(var_1_11_Pointer)) [L65] EXPR \read(*var_1_18_Pointer) [L65] (*(var_1_7_Pointer)) = (*(var_1_18_Pointer)) [L66] EXPR \read(*var_1_3_Pointer) [L66] signed long int stepLocal_1 = - (*(var_1_3_Pointer)); [L67] EXPR \read(*var_1_7_Pointer) [L67] EXPR \read(*var_1_3_Pointer) [L67] signed long int stepLocal_0 = (*(var_1_7_Pointer)) / (*(var_1_3_Pointer)); [L68] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L68] COND FALSE !(stepLocal_0 >= (*(var_1_7_Pointer))) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_3_Pointer) [L104] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1 [L104] EXPR (((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_18_Pointer) [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) [L104] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) [L104] EXPR \read(*var_1_8_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) [L104] EXPR \read(*var_1_13_Pointer) [L104] EXPR \read(*var_1_14_Pointer) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))) [L104] EXPR \read(*var_1_12_Pointer) [L104] EXPR \read(*var_1_17_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR ((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104-L105] return (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.6s, OverallIterations: 29, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5788 SdHoareTripleChecker+Valid, 14.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5788 mSDsluCounter, 27075 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 180 IncrementalHoareTripleChecker+Unchecked, 21985 mSDsCounter, 674 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6521 IncrementalHoareTripleChecker+Invalid, 7375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 674 mSolverCounterUnsat, 5090 mSDtfsCounter, 6521 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1478 GetRequests, 1177 SyntacticMatches, 2 SemanticMatches, 299 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=517occurred in iteration=21, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 2035 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 35.4s InterpolantComputationTime, 4188 NumberOfCodeBlocks, 4188 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3881 ConstructedInterpolants, 4 QuantifiedInterpolants, 20796 SizeOfPredicates, 11 NumberOfNonLiveVariables, 619 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 29 InterpolantComputations, 27 PerfectInterpolantSequences, 12004/12180 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:23:55,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:23:58,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:23:58,404 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:23:58,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:23:58,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:23:58,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:23:58,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:23:58,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:23:58,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:23:58,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:23:58,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:23:58,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:23:58,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:23:58,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:23:58,477 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:23:58,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:23:58,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:23:58,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:23:58,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:23:58,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:23:58,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:23:58,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:23:58,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:23:58,485 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:23:58,485 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:23:58,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:23:58,486 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:23:58,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:23:58,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:23:58,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:23:58,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:23:58,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:23:58,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:23:58,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:23:58,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:23:58,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:23:58,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:23:58,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:23:58,493 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:23:58,493 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:23:58,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:23:58,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:23:58,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:23:58,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:23:58,517 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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 -> e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 [2024-11-08 17:23:59,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:23:59,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:23:59,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:23:59,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:23:59,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:23:59,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i Unable to find full path for "g++" [2024-11-08 17:24:01,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:24:01,927 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:24:01,929 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2024-11-08 17:24:01,949 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/data/11b31702b/1d2977a67c0747d9926dba38649da697/FLAG8f3ec7629 [2024-11-08 17:24:01,973 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/data/11b31702b/1d2977a67c0747d9926dba38649da697 [2024-11-08 17:24:01,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:24:01,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:24:01,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:24:01,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:24:01,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:24:01,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:24:01" (1/1) ... [2024-11-08 17:24:01,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3d2d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:01, skipping insertion in model container [2024-11-08 17:24:01,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:24:01" (1/1) ... [2024-11-08 17:24:02,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:24:02,338 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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2024-11-08 17:24:02,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:24:02,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:24:02,518 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_4cddf89c-bcbe-4601-9bbe-f4048602cd99/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2024-11-08 17:24:02,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:24:02,631 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:24:02,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02 WrapperNode [2024-11-08 17:24:02,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:24:02,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:24:02,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:24:02,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:24:02,645 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:24:02" (1/1) ... [2024-11-08 17:24:02,676 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:24:02" (1/1) ... [2024-11-08 17:24:02,751 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 523 [2024-11-08 17:24:02,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:24:02,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:24:02,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:24:02,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:24:02,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (1/1) ... [2024-11-08 17:24:02,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (1/1) ... [2024-11-08 17:24:02,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (1/1) ... [2024-11-08 17:24:02,882 INFO L175 MemorySlicer]: Split 130 memory accesses to 14 slices as follows [2, 3, 11, 9, 13, 18, 14, 6, 8, 8, 11, 11, 6, 10]. 14 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2024-11-08 17:24:02,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (1/1) ... [2024-11-08 17:24:02,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (1/1) ... [2024-11-08 17:24:02,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (1/1) ... [2024-11-08 17:24:02,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (1/1) ... [2024-11-08 17:24:02,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (1/1) ... [2024-11-08 17:24:02,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (1/1) ... [2024-11-08 17:24:02,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:24:03,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:24:03,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:24:03,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:24:03,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (1/1) ... [2024-11-08 17:24:03,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:24:03,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:03,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:24:03,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:24:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:24:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:24:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:24:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 17:24:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 17:24:03,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 17:24:03,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 17:24:03,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-08 17:24:03,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-08 17:24:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-08 17:24:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-08 17:24:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-08 17:24:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-08 17:24:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-08 17:24:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-08 17:24:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 17:24:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 17:24:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 17:24:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 17:24:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 17:24:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-08 17:24:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-08 17:24:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-08 17:24:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-08 17:24:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-08 17:24:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-08 17:24:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-08 17:24:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-08 17:24:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-08 17:24:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:24:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:24:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 17:24:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 17:24:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 17:24:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 17:24:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-08 17:24:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-08 17:24:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-08 17:24:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-08 17:24:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-08 17:24:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-08 17:24:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-08 17:24:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-08 17:24:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 17:24:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 17:24:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 17:24:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 17:24:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 17:24:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-08 17:24:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-08 17:24:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-08 17:24:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-08 17:24:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-08 17:24:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-08 17:24:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-08 17:24:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-08 17:24:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-08 17:24:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 17:24:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 17:24:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 17:24:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 17:24:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-08 17:24:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-08 17:24:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-08 17:24:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-08 17:24:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-08 17:24:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-08 17:24:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-08 17:24:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-08 17:24:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-08 17:24:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-08 17:24:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:24:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:24:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 17:24:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 17:24:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 17:24:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-08 17:24:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-08 17:24:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-08 17:24:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-08 17:24:03,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-08 17:24:03,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-08 17:24:03,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-08 17:24:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-08 17:24:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-08 17:24:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 17:24:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 17:24:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 17:24:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 17:24:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 17:24:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-08 17:24:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-08 17:24:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-08 17:24:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-08 17:24:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-08 17:24:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-08 17:24:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-08 17:24:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-08 17:24:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-08 17:24:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 17:24:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 17:24:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 17:24:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 17:24:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-08 17:24:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-08 17:24:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-08 17:24:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-08 17:24:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-08 17:24:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-08 17:24:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-08 17:24:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-08 17:24:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-08 17:24:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-08 17:24:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 17:24:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 17:24:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 17:24:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 17:24:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-08 17:24:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-08 17:24:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-08 17:24:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-08 17:24:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-08 17:24:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-08 17:24:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-08 17:24:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-08 17:24:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-08 17:24:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-08 17:24:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:24:03,128 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:24:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:24:03,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:24:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:24:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:24:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 17:24:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 17:24:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 17:24:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 17:24:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-08 17:24:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-08 17:24:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-08 17:24:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-08 17:24:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-08 17:24:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-08 17:24:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-08 17:24:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-08 17:24:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 17:24:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 17:24:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 17:24:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 17:24:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 17:24:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-08 17:24:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-08 17:24:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-08 17:24:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-08 17:24:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-08 17:24:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-08 17:24:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-08 17:24:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-08 17:24:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-08 17:24:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:24:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:24:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 17:24:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 17:24:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 17:24:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-08 17:24:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-08 17:24:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-08 17:24:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-08 17:24:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-08 17:24:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-08 17:24:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-08 17:24:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-08 17:24:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-08 17:24:03,535 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:24:03,537 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:24:17,718 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-08 17:24:17,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:24:17,757 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:24:17,761 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:24:17,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:24:17 BoogieIcfgContainer [2024-11-08 17:24:17,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:24:17,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:24:17,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:24:17,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:24:17,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:24:01" (1/3) ... [2024-11-08 17:24:17,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31168ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:24:17, skipping insertion in model container [2024-11-08 17:24:17,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:02" (2/3) ... [2024-11-08 17:24:17,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31168ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:24:17, skipping insertion in model container [2024-11-08 17:24:17,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:24:17" (3/3) ... [2024-11-08 17:24:17,779 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-4.i [2024-11-08 17:24:17,800 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:24:17,801 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:24:17,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:24:17,893 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;@470c6ec9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:24:17,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:24:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:24:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 17:24:17,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:17,919 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:17,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:24:17,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1170486752, now seen corresponding path program 1 times [2024-11-08 17:24:17,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:24:17,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140480075] [2024-11-08 17:24:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:17,947 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:24:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:24:17,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:24:17,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:24:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:19,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:24:19,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-08 17:24:19,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:24:19,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:24:19,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140480075] [2024-11-08 17:24:19,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140480075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:19,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:24:19,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336023941] [2024-11-08 17:24:19,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:19,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:24:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:24:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:24:19,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:24:19,249 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 17:24:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:19,312 INFO L93 Difference]: Finished difference Result 213 states and 331 transitions. [2024-11-08 17:24:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:24:19,315 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-08 17:24:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:19,325 INFO L225 Difference]: With dead ends: 213 [2024-11-08 17:24:19,325 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 17:24:19,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:24:19,335 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:19,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:24:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 17:24:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-08 17:24:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:24:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-08 17:24:19,397 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2024-11-08 17:24:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:19,397 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-08 17:24:19,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 17:24:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-08 17:24:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 17:24:19,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:19,407 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:19,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:24:19,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:24:19,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:24:19,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1675110542, now seen corresponding path program 1 times [2024-11-08 17:24:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:24:19,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512681924] [2024-11-08 17:24:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:19,613 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:24:19,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:24:19,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:24:19,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:24:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:20,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 17:24:20,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:21,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 17:24:26,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-08 17:24:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-08 17:24:26,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:30,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:24:30,804 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 25 treesize of output 28 [2024-11-08 17:24:32,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:24:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512681924] [2024-11-08 17:24:32,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512681924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893420002] [2024-11-08 17:24:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:32,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:32,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:32,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:24:32,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:24:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:33,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:24:33,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:24:33,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:24:33,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893420002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:33,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:24:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-08 17:24:33,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414580786] [2024-11-08 17:24:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:33,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:24:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:24:33,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:24:33,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:24:33,493 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:24:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:33,612 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2024-11-08 17:24:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:24:33,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 17:24:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:33,617 INFO L225 Difference]: With dead ends: 212 [2024-11-08 17:24:33,617 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 17:24:33,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:24:33,621 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:33,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:24:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 17:24:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-08 17:24:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:24:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-08 17:24:33,640 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2024-11-08 17:24:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:33,642 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-08 17:24:33,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:24:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-08 17:24:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 17:24:33,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:33,646 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:24:33,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:24:33,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 17:24:34,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:34,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:24:34,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1673263500, now seen corresponding path program 1 times [2024-11-08 17:24:34,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:24:34,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716643851] [2024-11-08 17:24:34,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:34,053 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:24:34,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:24:34,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:24:34,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:24:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:35,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 17:24:35,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:35,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 17:24:39,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-08 17:24:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-08 17:24:39,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:24:43,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:24:43,591 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 25 treesize of output 28 [2024-11-08 17:24:45,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:24:45,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716643851] [2024-11-08 17:24:45,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716643851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:24:45,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543869902] [2024-11-08 17:24:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:45,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:24:45,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:24:45,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:24:45,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:24:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:45,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:24:45,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:24:46,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 17:24:47,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 17:24:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:24:48,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:24:48,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543869902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:48,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:24:48,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-08 17:24:48,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260873486] [2024-11-08 17:24:48,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:48,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:24:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:24:48,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:24:48,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:24:48,790 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:24:53,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:24:58,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:25:00,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:25:04,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:25:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:25:04,882 INFO L93 Difference]: Finished difference Result 315 states and 457 transitions. [2024-11-08 17:25:04,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:25:04,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 17:25:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:25:04,916 INFO L225 Difference]: With dead ends: 315 [2024-11-08 17:25:04,917 INFO L226 Difference]: Without dead ends: 210 [2024-11-08 17:25:04,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:25:04,921 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 146 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:25:04,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 545 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 64 Invalid, 2 Unknown, 0 Unchecked, 15.5s Time] [2024-11-08 17:25:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-08 17:25:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 189. [2024-11-08 17:25:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 156 states have internal predecessors, (215), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:25:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2024-11-08 17:25:04,951 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 130 [2024-11-08 17:25:04,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:25:04,952 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2024-11-08 17:25:04,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:25:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2024-11-08 17:25:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 17:25:04,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:25:04,956 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:25:05,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 17:25:05,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:25:05,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:05,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:25:05,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:25:05,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1266633725, now seen corresponding path program 1 times [2024-11-08 17:25:05,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:25:05,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783557173] [2024-11-08 17:25:05,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:25:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:25:05,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:05,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:06,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:25:06,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:06,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-08 17:25:06,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-11-08 17:25:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:25:06,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:25:06,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:25:06,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783557173] [2024-11-08 17:25:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783557173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:25:06,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:25:06,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:25:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186507098] [2024-11-08 17:25:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:25:06,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:25:06,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:25:06,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:25:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:25:06,595 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:25:07,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:25:07,088 INFO L93 Difference]: Finished difference Result 298 states and 434 transitions. [2024-11-08 17:25:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:25:07,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 17:25:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:25:07,098 INFO L225 Difference]: With dead ends: 298 [2024-11-08 17:25:07,098 INFO L226 Difference]: Without dead ends: 193 [2024-11-08 17:25:07,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:25:07,103 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 148 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:25:07,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 798 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:25:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-08 17:25:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-08 17:25:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 160 states have (on average 1.36875) internal successors, (219), 160 states have internal predecessors, (219), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:25:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 279 transitions. [2024-11-08 17:25:07,139 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 279 transitions. Word has length 130 [2024-11-08 17:25:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:25:07,139 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 279 transitions. [2024-11-08 17:25:07,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:25:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 279 transitions. [2024-11-08 17:25:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 17:25:07,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:25:07,147 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:25:07,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-08 17:25:07,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:07,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:25:07,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:25:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1967698303, now seen corresponding path program 1 times [2024-11-08 17:25:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:25:07,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510260576] [2024-11-08 17:25:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:07,350 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:25:07,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:25:07,351 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:07,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:08,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:25:08,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:25:08,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:25:08,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:25:08,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510260576] [2024-11-08 17:25:08,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510260576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:25:08,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:25:08,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:25:08,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875849239] [2024-11-08 17:25:08,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:25:08,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:25:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:25:08,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:25:08,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:25:08,416 INFO L87 Difference]: Start difference. First operand 193 states and 279 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:25:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:25:08,528 INFO L93 Difference]: Finished difference Result 307 states and 444 transitions. [2024-11-08 17:25:08,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:25:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-08 17:25:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:25:08,531 INFO L225 Difference]: With dead ends: 307 [2024-11-08 17:25:08,531 INFO L226 Difference]: Without dead ends: 197 [2024-11-08 17:25:08,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:25:08,534 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:25:08,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:25:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-08 17:25:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-08 17:25:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 164 states have (on average 1.3597560975609757) internal successors, (223), 164 states have internal predecessors, (223), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:25:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 283 transitions. [2024-11-08 17:25:08,574 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 283 transitions. Word has length 130 [2024-11-08 17:25:08,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:25:08,575 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 283 transitions. [2024-11-08 17:25:08,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:25:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 283 transitions. [2024-11-08 17:25:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 17:25:08,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:25:08,578 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:25:08,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:25:08,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:08,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:25:08,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:25:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1392069327, now seen corresponding path program 1 times [2024-11-08 17:25:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:25:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787813227] [2024-11-08 17:25:08,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:08,781 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:25:08,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:25:08,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:08,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:09,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:25:09,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:25:09,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:25:09,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:25:09,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787813227] [2024-11-08 17:25:09,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787813227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:25:09,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:25:09,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:25:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593477701] [2024-11-08 17:25:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:25:09,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:25:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:25:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:25:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:25:09,924 INFO L87 Difference]: Start difference. First operand 197 states and 283 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:25:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:25:10,074 INFO L93 Difference]: Finished difference Result 315 states and 452 transitions. [2024-11-08 17:25:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:25:10,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-08 17:25:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:25:10,078 INFO L225 Difference]: With dead ends: 315 [2024-11-08 17:25:10,078 INFO L226 Difference]: Without dead ends: 203 [2024-11-08 17:25:10,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:25:10,080 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:25:10,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:25:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-08 17:25:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2024-11-08 17:25:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 166 states have (on average 1.355421686746988) internal successors, (225), 166 states have internal predecessors, (225), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:25:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 285 transitions. [2024-11-08 17:25:10,102 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 285 transitions. Word has length 132 [2024-11-08 17:25:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:25:10,103 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 285 transitions. [2024-11-08 17:25:10,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:25:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 285 transitions. [2024-11-08 17:25:10,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:25:10,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:25:10,111 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:25:10,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:10,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:10,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:25:10,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:25:10,312 INFO L85 PathProgramCache]: Analyzing trace with hash 173114966, now seen corresponding path program 1 times [2024-11-08 17:25:10,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:25:10,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971098888] [2024-11-08 17:25:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:10,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:25:10,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:25:10,318 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:10,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 [2024-11-08 17:25:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:11,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 17:25:11,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:13,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-08 17:25:13,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 17:25:13,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-08 17:25:13,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-08 17:25:13,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 17:25:15,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2024-11-08 17:25:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-08 17:25:17,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:25:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:25:20,894 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:25:20,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971098888] [2024-11-08 17:25:20,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971098888] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:25:20,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:25:20,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-08 17:25:20,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939787808] [2024-11-08 17:25:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:25:20,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:25:20,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:25:20,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:25:20,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:25:20,897 INFO L87 Difference]: Start difference. First operand 199 states and 285 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:25:28,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:25:37,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:25:41,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:25:45,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:25:50,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:25:51,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:25:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:25:52,669 INFO L93 Difference]: Finished difference Result 368 states and 520 transitions. [2024-11-08 17:25:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:25:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:25:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:25:52,685 INFO L225 Difference]: With dead ends: 368 [2024-11-08 17:25:52,685 INFO L226 Difference]: Without dead ends: 249 [2024-11-08 17:25:52,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:25:52,686 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 274 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:25:52,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 575 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 4 Unknown, 0 Unchecked, 29.2s Time] [2024-11-08 17:25:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-08 17:25:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 199. [2024-11-08 17:25:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 166 states have internal predecessors, (223), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:25:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 283 transitions. [2024-11-08 17:25:52,710 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 283 transitions. Word has length 134 [2024-11-08 17:25:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:25:52,711 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 283 transitions. [2024-11-08 17:25:52,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:25:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 283 transitions. [2024-11-08 17:25:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:25:52,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:25:52,714 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:25:52,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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)] Ended with exit code 0 [2024-11-08 17:25:52,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:52,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:25:52,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:25:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1106748712, now seen corresponding path program 1 times [2024-11-08 17:25:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:25:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670094552] [2024-11-08 17:25:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:52,917 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:25:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:25:52,918 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:25:52,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (11)] Waiting until timeout for monitored process [2024-11-08 17:25:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:53,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 17:25:53,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:25:54,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-08 17:25:54,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-08 17:25:55,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2024-11-08 17:25:55,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-11-08 17:25:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:25:55,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:25:55,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:25:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670094552] [2024-11-08 17:25:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670094552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:25:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:25:55,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:25:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781868001] [2024-11-08 17:25:55,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:25:55,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:25:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:25:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:25:55,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:25:55,932 INFO L87 Difference]: Start difference. First operand 199 states and 283 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:26:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:26:00,977 INFO L93 Difference]: Finished difference Result 361 states and 505 transitions. [2024-11-08 17:26:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:26:00,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:26:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:26:00,986 INFO L225 Difference]: With dead ends: 361 [2024-11-08 17:26:00,986 INFO L226 Difference]: Without dead ends: 237 [2024-11-08 17:26:00,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:26:00,988 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 223 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:26:00,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 499 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 17:26:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-08 17:26:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2024-11-08 17:26:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 170 states have (on average 1.3352941176470587) internal successors, (227), 170 states have internal predecessors, (227), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 17:26:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 287 transitions. [2024-11-08 17:26:01,012 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 287 transitions. Word has length 134 [2024-11-08 17:26:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:26:01,013 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 287 transitions. [2024-11-08 17:26:01,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:26:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 287 transitions. [2024-11-08 17:26:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:26:01,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:26:01,016 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:26:01,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (11)] Ended with exit code 0 [2024-11-08 17:26:01,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:26:01,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:26:01,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:26:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash -527777708, now seen corresponding path program 1 times [2024-11-08 17:26:01,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:26:01,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361491872] [2024-11-08 17:26:01,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:26:01,218 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:26:01,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:26:01,220 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:26:01,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (12)] Waiting until timeout for monitored process [2024-11-08 17:26:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:26:02,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 17:26:02,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:26:02,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-08 17:26:03,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-08 17:26:03,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-08 17:26:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-08 17:26:03,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:26:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:26:04,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:26:04,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361491872] [2024-11-08 17:26:04,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361491872] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:26:04,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:26:04,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 14 [2024-11-08 17:26:04,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111786463] [2024-11-08 17:26:04,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:26:04,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:26:04,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:26:04,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:26:04,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:26:04,581 INFO L87 Difference]: Start difference. First operand 203 states and 287 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:26:08,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:13,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:17,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:21,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:25,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:29,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:34,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:38,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:42,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:46,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:50,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:54,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:26:57,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:01,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:05,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:27:05,636 INFO L93 Difference]: Finished difference Result 415 states and 576 transitions. [2024-11-08 17:27:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:27:05,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:27:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:27:05,639 INFO L225 Difference]: With dead ends: 415 [2024-11-08 17:27:05,639 INFO L226 Difference]: Without dead ends: 303 [2024-11-08 17:27:05,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:27:05,641 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 69 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:27:05,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1027 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 9 Unknown, 0 Unchecked, 60.5s Time] [2024-11-08 17:27:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-08 17:27:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2024-11-08 17:27:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 262 states have (on average 1.3282442748091603) internal successors, (348), 263 states have internal predecessors, (348), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 17:27:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 414 transitions. [2024-11-08 17:27:05,672 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 414 transitions. Word has length 134 [2024-11-08 17:27:05,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:27:05,673 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 414 transitions. [2024-11-08 17:27:05,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:27:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 414 transitions. [2024-11-08 17:27:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:27:05,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:27:05,675 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:27:05,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (12)] Ended with exit code 0 [2024-11-08 17:27:05,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:27:05,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:27:05,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:27:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash 173286870, now seen corresponding path program 1 times [2024-11-08 17:27:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:27:05,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401447987] [2024-11-08 17:27:05,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:27:05,878 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:27:05,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:27:05,880 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:27:05,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (13)] Waiting until timeout for monitored process [2024-11-08 17:27:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:27:06,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 17:27:06,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:27:09,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-08 17:27:09,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-08 17:27:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-08 17:27:09,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:27:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:27:10,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:27:10,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401447987] [2024-11-08 17:27:10,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401447987] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:27:10,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:27:10,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-08 17:27:10,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092439696] [2024-11-08 17:27:10,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:27:10,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:27:10,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:27:10,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:27:10,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:27:10,222 INFO L87 Difference]: Start difference. First operand 300 states and 414 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:27:14,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:18,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:22,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:25,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:29,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:32,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:36,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:41,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:46,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:48,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:51,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:55,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:27:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:27:56,145 INFO L93 Difference]: Finished difference Result 478 states and 659 transitions. [2024-11-08 17:27:56,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:27:56,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:27:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:27:56,148 INFO L225 Difference]: With dead ends: 478 [2024-11-08 17:27:56,148 INFO L226 Difference]: Without dead ends: 302 [2024-11-08 17:27:56,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:27:56,150 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 60 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:27:56,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 575 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 6 Unknown, 0 Unchecked, 45.8s Time] [2024-11-08 17:27:56,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-08 17:27:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2024-11-08 17:27:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 261 states have (on average 1.3256704980842913) internal successors, (346), 262 states have internal predecessors, (346), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 17:27:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 412 transitions. [2024-11-08 17:27:56,201 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 412 transitions. Word has length 134 [2024-11-08 17:27:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:27:56,201 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 412 transitions. [2024-11-08 17:27:56,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:27:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 412 transitions. [2024-11-08 17:27:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:27:56,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:27:56,204 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:27:56,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (13)] Ended with exit code 0 [2024-11-08 17:27:56,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:27:56,405 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:27:56,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:27:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash -387229098, now seen corresponding path program 1 times [2024-11-08 17:27:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:27:56,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831317190] [2024-11-08 17:27:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:27:56,407 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:27:56,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:27:56,408 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:27:56,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (14)] Waiting until timeout for monitored process [2024-11-08 17:27:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:27:57,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 17:27:57,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:27:59,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-08 17:27:59,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-08 17:28:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-08 17:28:00,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:28:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:28:01,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:28:01,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831317190] [2024-11-08 17:28:01,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831317190] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:28:01,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:28:01,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-08 17:28:01,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348973507] [2024-11-08 17:28:01,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:28:01,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:28:01,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:28:01,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:28:01,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:28:01,052 INFO L87 Difference]: Start difference. First operand 299 states and 412 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:28:05,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:07,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:11,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:13,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:18,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:22,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:24,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:28,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:32,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:35,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:39,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:41,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:28:42,229 INFO L93 Difference]: Finished difference Result 536 states and 736 transitions. [2024-11-08 17:28:42,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:28:42,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:28:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:28:42,235 INFO L225 Difference]: With dead ends: 536 [2024-11-08 17:28:42,236 INFO L226 Difference]: Without dead ends: 361 [2024-11-08 17:28:42,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:28:42,240 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 62 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:28:42,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 615 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 41.1s Time] [2024-11-08 17:28:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-08 17:28:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 329. [2024-11-08 17:28:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 292 states have internal predecessors, (387), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-08 17:28:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 453 transitions. [2024-11-08 17:28:42,273 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 453 transitions. Word has length 134 [2024-11-08 17:28:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:28:42,275 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 453 transitions. [2024-11-08 17:28:42,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:28:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 453 transitions. [2024-11-08 17:28:42,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 17:28:42,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:28:42,277 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:28:42,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (14)] Ended with exit code 0 [2024-11-08 17:28:42,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:28:42,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:28:42,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:28:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash 313835480, now seen corresponding path program 1 times [2024-11-08 17:28:42,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:28:42,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169379364] [2024-11-08 17:28:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:42,481 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:28:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:28:42,485 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:28:42,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (15)] Waiting until timeout for monitored process [2024-11-08 17:28:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:43,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 17:28:43,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:28:44,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-08 17:28:44,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-08 17:28:44,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-08 17:28:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 17:28:45,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:28:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:28:46,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:28:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169379364] [2024-11-08 17:28:46,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169379364] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:28:46,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:28:46,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 14 [2024-11-08 17:28:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645257243] [2024-11-08 17:28:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:28:46,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:28:46,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:28:46,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:28:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:28:46,252 INFO L87 Difference]: Start difference. First operand 329 states and 453 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:28:50,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:54,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:28:59,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:29:03,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:29:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:04,143 INFO L93 Difference]: Finished difference Result 577 states and 789 transitions. [2024-11-08 17:29:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:29:04,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-08 17:29:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:04,147 INFO L225 Difference]: With dead ends: 577 [2024-11-08 17:29:04,147 INFO L226 Difference]: Without dead ends: 372 [2024-11-08 17:29:04,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:29:04,149 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 70 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:04,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1512 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 2 Unknown, 0 Unchecked, 17.4s Time] [2024-11-08 17:29:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-08 17:29:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 369. [2024-11-08 17:29:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 324 states have (on average 1.3179012345679013) internal successors, (427), 326 states have internal predecessors, (427), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 17:29:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 503 transitions. [2024-11-08 17:29:04,186 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 503 transitions. Word has length 134 [2024-11-08 17:29:04,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:04,186 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 503 transitions. [2024-11-08 17:29:04,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:29:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 503 transitions. [2024-11-08 17:29:04,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 17:29:04,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:04,189 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:04,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (15)] Ended with exit code 0 [2024-11-08 17:29:04,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:04,390 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash -272782321, now seen corresponding path program 1 times [2024-11-08 17:29:04,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:04,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302375144] [2024-11-08 17:29:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:04,391 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:04,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:04,392 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:04,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (16)] Waiting until timeout for monitored process [2024-11-08 17:29:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:05,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 17:29:05,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:07,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-08 17:29:07,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-08 17:29:09,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2024-11-08 17:29:09,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-08 17:29:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-08 17:29:10,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:29:11,296 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302375144] [2024-11-08 17:29:11,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302375144] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:11,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:29:11,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-08 17:29:11,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170661129] [2024-11-08 17:29:11,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:11,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:11,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:11,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:11,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:29:11,299 INFO L87 Difference]: Start difference. First operand 369 states and 503 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:29:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:12,072 INFO L93 Difference]: Finished difference Result 753 states and 1013 transitions. [2024-11-08 17:29:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-08 17:29:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:12,077 INFO L225 Difference]: With dead ends: 753 [2024-11-08 17:29:12,078 INFO L226 Difference]: Without dead ends: 488 [2024-11-08 17:29:12,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:29:12,080 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 76 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:12,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 632 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:29:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-08 17:29:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 384. [2024-11-08 17:29:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 339 states have (on average 1.3185840707964602) internal successors, (447), 341 states have internal predecessors, (447), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 17:29:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 523 transitions. [2024-11-08 17:29:12,131 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 523 transitions. Word has length 135 [2024-11-08 17:29:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:12,132 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 523 transitions. [2024-11-08 17:29:12,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:29:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 523 transitions. [2024-11-08 17:29:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:29:12,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:12,134 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:12,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (16)] Ended with exit code 0 [2024-11-08 17:29:12,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:12,335 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:12,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1045158901, now seen corresponding path program 1 times [2024-11-08 17:29:12,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:12,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411967907] [2024-11-08 17:29:12,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:12,337 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:12,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:12,341 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:12,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (17)] Waiting until timeout for monitored process [2024-11-08 17:29:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:13,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 17:29:13,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:14,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-08 17:29:15,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2024-11-08 17:29:15,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-08 17:29:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 17:29:15,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:29:16,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:16,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411967907] [2024-11-08 17:29:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411967907] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:16,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:29:16,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-11-08 17:29:16,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958154454] [2024-11-08 17:29:16,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:16,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:16,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:16,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:16,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:29:16,151 INFO L87 Difference]: Start difference. First operand 384 states and 523 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:29:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:16,959 INFO L93 Difference]: Finished difference Result 399 states and 539 transitions. [2024-11-08 17:29:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:29:16,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 17:29:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:16,965 INFO L225 Difference]: With dead ends: 399 [2024-11-08 17:29:16,965 INFO L226 Difference]: Without dead ends: 397 [2024-11-08 17:29:16,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:29:16,967 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 55 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:16,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 720 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:29:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-08 17:29:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-11-08 17:29:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 351 states have (on average 1.3076923076923077) internal successors, (459), 353 states have internal predecessors, (459), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 17:29:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 535 transitions. [2024-11-08 17:29:17,004 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 535 transitions. Word has length 137 [2024-11-08 17:29:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:17,005 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 535 transitions. [2024-11-08 17:29:17,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:29:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 535 transitions. [2024-11-08 17:29:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:29:17,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:17,008 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:17,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (17)] Forceful destruction successful, exit code 0 [2024-11-08 17:29:17,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:17,209 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:17,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1047005943, now seen corresponding path program 1 times [2024-11-08 17:29:17,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:17,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587382777] [2024-11-08 17:29:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:17,211 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:17,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:17,214 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:17,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (18)] Waiting until timeout for monitored process [2024-11-08 17:29:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:18,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 17:29:18,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:23,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2024-11-08 17:29:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-08 17:29:24,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:29:25,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587382777] [2024-11-08 17:29:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587382777] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:25,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:29:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-08 17:29:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755375183] [2024-11-08 17:29:25,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:25,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:29:25,204 INFO L87 Difference]: Start difference. First operand 397 states and 535 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:29:29,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:29:33,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:29:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:34,127 INFO L93 Difference]: Finished difference Result 954 states and 1274 transitions. [2024-11-08 17:29:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 17:29:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:34,135 INFO L225 Difference]: With dead ends: 954 [2024-11-08 17:29:34,135 INFO L226 Difference]: Without dead ends: 687 [2024-11-08 17:29:34,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:29:34,137 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 88 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:34,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 656 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-08 17:29:34,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-08 17:29:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 684. [2024-11-08 17:29:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 616 states have (on average 1.301948051948052) internal successors, (802), 621 states have internal predecessors, (802), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 17:29:34,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 912 transitions. [2024-11-08 17:29:34,205 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 912 transitions. Word has length 137 [2024-11-08 17:29:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:34,206 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 912 transitions. [2024-11-08 17:29:34,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:29:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 912 transitions. [2024-11-08 17:29:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:29:34,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:34,208 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:34,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (18)] Ended with exit code 0 [2024-11-08 17:29:34,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:34,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:34,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1727064313, now seen corresponding path program 1 times [2024-11-08 17:29:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:29:34,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449566952] [2024-11-08 17:29:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:34,411 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:34,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:29:34,415 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:34,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (19)] Waiting until timeout for monitored process [2024-11-08 17:29:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:36,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 17:29:36,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:29:39,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-08 17:29:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 1 proven. 227 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-08 17:29:40,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:29:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:29:41,670 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:29:41,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449566952] [2024-11-08 17:29:41,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449566952] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:29:41,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:29:41,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 16 [2024-11-08 17:29:41,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852595225] [2024-11-08 17:29:41,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:41,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:29:41,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:29:41,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:29:41,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:29:41,673 INFO L87 Difference]: Start difference. First operand 684 states and 912 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:29:45,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:29:49,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:29:53,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:29:55,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:29:58,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:30:02,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:30:06,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:30:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:07,194 INFO L93 Difference]: Finished difference Result 1680 states and 2212 transitions. [2024-11-08 17:30:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:30:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 17:30:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:07,202 INFO L225 Difference]: With dead ends: 1680 [2024-11-08 17:30:07,202 INFO L226 Difference]: Without dead ends: 1184 [2024-11-08 17:30:07,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:30:07,205 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 52 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:07,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 739 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 25.1s Time] [2024-11-08 17:30:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-11-08 17:30:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1008. [2024-11-08 17:30:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 940 states have (on average 1.3063829787234043) internal successors, (1228), 945 states have internal predecessors, (1228), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 17:30:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1338 transitions. [2024-11-08 17:30:07,278 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1338 transitions. Word has length 137 [2024-11-08 17:30:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:07,279 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1338 transitions. [2024-11-08 17:30:07,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:30:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1338 transitions. [2024-11-08 17:30:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:30:07,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:07,282 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:07,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (19)] Ended with exit code 0 [2024-11-08 17:30:07,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:30:07,483 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:07,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1665787914, now seen corresponding path program 1 times [2024-11-08 17:30:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:07,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291454785] [2024-11-08 17:30:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:07,484 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:30:07,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:07,485 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:30:07,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (20)] Waiting until timeout for monitored process [2024-11-08 17:30:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:08,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 17:30:08,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:10,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-08 17:30:10,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 17:30:10,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-08 17:30:11,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-08 17:30:11,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 17:30:13,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-08 17:30:13,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-08 17:30:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-08 17:30:14,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:30:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:30:15,739 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:30:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291454785] [2024-11-08 17:30:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291454785] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:15,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:30:15,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2024-11-08 17:30:15,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452452048] [2024-11-08 17:30:15,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:15,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:30:15,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:30:15,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:30:15,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:30:15,742 INFO L87 Difference]: Start difference. First operand 1008 states and 1338 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:30:19,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:30:23,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 17:30:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:23,681 INFO L93 Difference]: Finished difference Result 1860 states and 2452 transitions. [2024-11-08 17:30:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:30:23,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 17:30:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:23,694 INFO L225 Difference]: With dead ends: 1860 [2024-11-08 17:30:23,694 INFO L226 Difference]: Without dead ends: 1008 [2024-11-08 17:30:23,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:30:23,697 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 106 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:23,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 402 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-08 17:30:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2024-11-08 17:30:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2024-11-08 17:30:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 940 states have (on average 1.2851063829787235) internal successors, (1208), 945 states have internal predecessors, (1208), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 17:30:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1318 transitions. [2024-11-08 17:30:23,774 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1318 transitions. Word has length 137 [2024-11-08 17:30:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:23,775 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1318 transitions. [2024-11-08 17:30:23,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:30:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1318 transitions. [2024-11-08 17:30:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 17:30:23,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:23,778 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:23,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (20)] Forceful destruction successful, exit code 0 [2024-11-08 17:30:23,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:30:23,980 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:23,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash 848139464, now seen corresponding path program 1 times [2024-11-08 17:30:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:23,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120023455] [2024-11-08 17:30:23,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:23,982 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:30:23,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:23,986 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:30:23,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (21)] Waiting until timeout for monitored process [2024-11-08 17:30:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 17:30:25,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:26,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-08 17:30:29,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-08 17:30:30,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-11-08 17:30:30,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2024-11-08 17:30:32,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-08 17:30:32,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2024-11-08 17:30:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-08 17:30:35,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:30:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:30:41,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:30:41,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120023455] [2024-11-08 17:30:41,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120023455] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:30:41,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:30:41,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [19] total 27 [2024-11-08 17:30:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634739918] [2024-11-08 17:30:41,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:41,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:30:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:30:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:30:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:30:41,656 INFO L87 Difference]: Start difference. First operand 1008 states and 1318 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:30:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:51,640 INFO L93 Difference]: Finished difference Result 2572 states and 3290 transitions. [2024-11-08 17:30:51,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:30:51,647 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-08 17:30:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:51,662 INFO L225 Difference]: With dead ends: 2572 [2024-11-08 17:30:51,662 INFO L226 Difference]: Without dead ends: 1832 [2024-11-08 17:30:51,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 17:30:51,665 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 360 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:51,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 2253 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-08 17:30:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-08 17:30:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 908. [2024-11-08 17:30:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 840 states have (on average 1.2714285714285714) internal successors, (1068), 845 states have internal predecessors, (1068), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 17:30:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1178 transitions. [2024-11-08 17:30:51,748 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1178 transitions. Word has length 137 [2024-11-08 17:30:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:51,749 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1178 transitions. [2024-11-08 17:30:51,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:30:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1178 transitions. [2024-11-08 17:30:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:30:51,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:51,752 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:51,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (21)] Ended with exit code 0 [2024-11-08 17:30:51,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:30:51,953 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:51,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:51,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1192413630, now seen corresponding path program 1 times [2024-11-08 17:30:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:30:51,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625474515] [2024-11-08 17:30:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:51,954 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:30:51,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:30:51,955 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:30:51,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (22)] Waiting until timeout for monitored process [2024-11-08 17:30:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:53,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 17:30:53,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:30:53,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-08 17:30:53,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-08 17:30:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:30:54,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:30:54,221 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:30:54,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625474515] [2024-11-08 17:30:54,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625474515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:54,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:54,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:30:54,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222322195] [2024-11-08 17:30:54,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:54,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:30:54,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:30:54,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:30:54,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:30:54,224 INFO L87 Difference]: Start difference. First operand 908 states and 1178 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:30:58,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:31:02,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:31:06,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:31:10,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:31:16,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:31:17,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:31:21,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:31:25,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:31:29,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:31:34,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:31:37,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:31:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:39,077 INFO L93 Difference]: Finished difference Result 2014 states and 2588 transitions. [2024-11-08 17:31:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:31:39,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-08 17:31:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:39,083 INFO L225 Difference]: With dead ends: 2014 [2024-11-08 17:31:39,083 INFO L226 Difference]: Without dead ends: 1304 [2024-11-08 17:31:39,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:31:39,085 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 59 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:39,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1384 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 8 Unknown, 0 Unchecked, 44.4s Time] [2024-11-08 17:31:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2024-11-08 17:31:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1008. [2024-11-08 17:31:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 940 states have (on average 1.2659574468085106) internal successors, (1190), 945 states have internal predecessors, (1190), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-08 17:31:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1300 transitions. [2024-11-08 17:31:39,164 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1300 transitions. Word has length 139 [2024-11-08 17:31:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:39,165 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1300 transitions. [2024-11-08 17:31:39,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:31:39,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1300 transitions. [2024-11-08 17:31:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:31:39,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:39,167 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:39,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (22)] Ended with exit code 0 [2024-11-08 17:31:39,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:31:39,369 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:39,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:39,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1332962240, now seen corresponding path program 1 times [2024-11-08 17:31:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:31:39,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842688671] [2024-11-08 17:31:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:39,370 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:31:39,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:31:39,374 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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:31:39,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cddf89c-bcbe-4601-9bbe-f4048602cd99/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 (23)] Waiting until timeout for monitored process