./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:48:59,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:48:59,133 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:48:59,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:48:59,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:48:59,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:48:59,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:48:59,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:48:59,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:48:59,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:48:59,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:48:59,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:48:59,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:48:59,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:48:59,165 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:48:59,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:48:59,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:48:59,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:48:59,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:48:59,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:48:59,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:48:59,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:48:59,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:48:59,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:48:59,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:48:59,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:48:59,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:48:59,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:48:59,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:48:59,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:48:59,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:48:59,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:48:59,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:48:59,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:48:59,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:48:59,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:48:59,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:48:59,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:48:59,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:48:59,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:48:59,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:48:59,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:48:59,179 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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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 -> 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c [2024-11-08 17:48:59,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:48:59,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:48:59,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:48:59,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:48:59,517 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:48:59,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i Unable to find full path for "g++" [2024-11-08 17:49:01,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:49:01,831 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:49:01,831 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-08 17:49:01,844 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/data/c5e23e055/50aa93feb02a419c817e95f91994ff80/FLAG668a787b4 [2024-11-08 17:49:02,133 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/data/c5e23e055/50aa93feb02a419c817e95f91994ff80 [2024-11-08 17:49:02,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:49:02,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:49:02,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:49:02,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:49:02,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:49:02,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368b6963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02, skipping insertion in model container [2024-11-08 17:49:02,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:49:02,380 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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-11-08 17:49:02,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:49:02,496 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:49:02,507 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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-11-08 17:49:02,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:49:02,599 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:49:02,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02 WrapperNode [2024-11-08 17:49:02,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:49:02,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:49:02,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:49:02,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:49:02,609 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:49:02" (1/1) ... [2024-11-08 17:49:02,626 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:49:02" (1/1) ... [2024-11-08 17:49:02,678 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 588 [2024-11-08 17:49:02,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:49:02,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:49:02,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:49:02,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:49:02,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,724 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2024-11-08 17:49:02,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:49:02,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:49:02,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:49:02,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:49:02,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (1/1) ... [2024-11-08 17:49:02,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:49:02,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:49:02,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:49:02,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:49:02,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:49:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 17:49:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 17:49:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 17:49:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 17:49:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 17:49:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:49:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:49:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:49:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 17:49:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 17:49:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 17:49:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 17:49:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 17:49:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 17:49:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 17:49:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:49:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:49:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:49:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 17:49:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 17:49:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 17:49:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 17:49:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 17:49:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 17:49:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 17:49:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:49:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:49:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:49:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:49:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:49:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 17:49:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 17:49:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:49:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:49:03,035 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:49:03,037 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:49:03,881 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-08 17:49:03,881 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:49:03,902 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:49:03,902 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:49:03,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:49:03 BoogieIcfgContainer [2024-11-08 17:49:03,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:49:03,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:49:03,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:49:03,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:49:03,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:49:02" (1/3) ... [2024-11-08 17:49:03,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b8278c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:49:03, skipping insertion in model container [2024-11-08 17:49:03,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:49:02" (2/3) ... [2024-11-08 17:49:03,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b8278c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:49:03, skipping insertion in model container [2024-11-08 17:49:03,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:49:03" (3/3) ... [2024-11-08 17:49:03,914 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-08 17:49:03,932 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:49:03,932 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:49:04,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:49:04,012 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;@5df34282, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:49:04,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:49:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:49:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:49:04,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:04,047 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:04,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:04,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:04,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1346113287, now seen corresponding path program 1 times [2024-11-08 17:49:04,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:04,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783083906] [2024-11-08 17:49:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:04,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:04,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783083906] [2024-11-08 17:49:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783083906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:04,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:04,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:49:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668555530] [2024-11-08 17:49:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:04,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:49:04,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:49:04,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:49:04,711 INFO L87 Difference]: Start difference. First operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:49:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:04,746 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2024-11-08 17:49:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:49:04,748 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-08 17:49:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:04,758 INFO L225 Difference]: With dead ends: 245 [2024-11-08 17:49:04,758 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 17:49:04,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:49:04,766 INFO L432 NwaCegarLoop]: 180 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, 180 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:49:04,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 17:49:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-08 17:49:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:49:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-08 17:49:04,827 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2024-11-08 17:49:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:04,827 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-08 17:49:04,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:49:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-08 17:49:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:49:04,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:04,835 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:04,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:49:04,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:04,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1571512461, now seen corresponding path program 1 times [2024-11-08 17:49:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:04,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487089057] [2024-11-08 17:49:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:04,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487089057] [2024-11-08 17:49:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487089057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:05,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:05,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:49:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448755644] [2024-11-08 17:49:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:05,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:49:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:05,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:49:05,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:05,351 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:05,393 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2024-11-08 17:49:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:49:05,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-08 17:49:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:05,398 INFO L225 Difference]: With dead ends: 242 [2024-11-08 17:49:05,398 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 17:49:05,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:05,401 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:05,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 17:49:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-08 17:49:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:49:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2024-11-08 17:49:05,417 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2024-11-08 17:49:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:05,419 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2024-11-08 17:49:05,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2024-11-08 17:49:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:49:05,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:05,422 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:05,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:49:05,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:05,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:05,424 INFO L85 PathProgramCache]: Analyzing trace with hash 753864011, now seen corresponding path program 1 times [2024-11-08 17:49:05,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:05,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311674263] [2024-11-08 17:49:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:05,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:08,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:08,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:08,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:08,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311674263] [2024-11-08 17:49:08,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311674263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:08,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:08,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:49:08,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869026847] [2024-11-08 17:49:08,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:08,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:49:08,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:08,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:49:08,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:49:08,104 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:49:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:10,641 INFO L93 Difference]: Finished difference Result 725 states and 1076 transitions. [2024-11-08 17:49:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 17:49:10,645 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-08 17:49:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:10,653 INFO L225 Difference]: With dead ends: 725 [2024-11-08 17:49:10,654 INFO L226 Difference]: Without dead ends: 605 [2024-11-08 17:49:10,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2024-11-08 17:49:10,659 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 939 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:10,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2764 Invalid, 1631 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [153 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 17:49:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-08 17:49:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 382. [2024-11-08 17:49:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 331 states have (on average 1.4501510574018126) internal successors, (480), 332 states have internal predecessors, (480), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-08 17:49:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 574 transitions. [2024-11-08 17:49:10,754 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 574 transitions. Word has length 151 [2024-11-08 17:49:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:10,755 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 574 transitions. [2024-11-08 17:49:10,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:49:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 574 transitions. [2024-11-08 17:49:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 17:49:10,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:10,762 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:49:10,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:10,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash -105489525, now seen corresponding path program 1 times [2024-11-08 17:49:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:10,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113092749] [2024-11-08 17:49:10,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:10,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:11,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:11,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113092749] [2024-11-08 17:49:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113092749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:11,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:11,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:49:11,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656450596] [2024-11-08 17:49:11,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:11,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:49:11,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:11,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:49:11,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:11,029 INFO L87 Difference]: Start difference. First operand 382 states and 574 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:11,080 INFO L93 Difference]: Finished difference Result 758 states and 1141 transitions. [2024-11-08 17:49:11,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:49:11,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-08 17:49:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:11,085 INFO L225 Difference]: With dead ends: 758 [2024-11-08 17:49:11,085 INFO L226 Difference]: Without dead ends: 379 [2024-11-08 17:49:11,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:11,088 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:11,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-08 17:49:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-08 17:49:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4451219512195121) internal successors, (474), 329 states have internal predecessors, (474), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-08 17:49:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 568 transitions. [2024-11-08 17:49:11,134 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 568 transitions. Word has length 152 [2024-11-08 17:49:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:11,137 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 568 transitions. [2024-11-08 17:49:11,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 568 transitions. [2024-11-08 17:49:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 17:49:11,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:11,141 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:49:11,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:11,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:11,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1730979357, now seen corresponding path program 1 times [2024-11-08 17:49:11,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:11,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564598093] [2024-11-08 17:49:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:11,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:11,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:11,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564598093] [2024-11-08 17:49:11,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564598093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:11,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:11,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:49:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011265615] [2024-11-08 17:49:11,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:11,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:49:11,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:11,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:49:11,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:11,379 INFO L87 Difference]: Start difference. First operand 379 states and 568 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:11,434 INFO L93 Difference]: Finished difference Result 760 states and 1143 transitions. [2024-11-08 17:49:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:49:11,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-08 17:49:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:11,438 INFO L225 Difference]: With dead ends: 760 [2024-11-08 17:49:11,438 INFO L226 Difference]: Without dead ends: 384 [2024-11-08 17:49:11,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:11,440 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 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:49:11,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-08 17:49:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-08 17:49:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 333 states have (on average 1.4384384384384385) internal successors, (479), 334 states have internal predecessors, (479), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-08 17:49:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 573 transitions. [2024-11-08 17:49:11,469 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 573 transitions. Word has length 152 [2024-11-08 17:49:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:11,470 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 573 transitions. [2024-11-08 17:49:11,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 573 transitions. [2024-11-08 17:49:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 17:49:11,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:11,473 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:49:11,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:11,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:11,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1902190111, now seen corresponding path program 1 times [2024-11-08 17:49:11,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:11,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540371010] [2024-11-08 17:49:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:11,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:11,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540371010] [2024-11-08 17:49:11,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540371010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:11,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:11,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:49:11,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928250112] [2024-11-08 17:49:11,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:11,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:49:11,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:11,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:49:11,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:11,655 INFO L87 Difference]: Start difference. First operand 384 states and 573 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:11,702 INFO L93 Difference]: Finished difference Result 760 states and 1135 transitions. [2024-11-08 17:49:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:49:11,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-11-08 17:49:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:11,706 INFO L225 Difference]: With dead ends: 760 [2024-11-08 17:49:11,706 INFO L226 Difference]: Without dead ends: 379 [2024-11-08 17:49:11,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:11,708 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:11,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-08 17:49:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-08 17:49:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4298780487804879) internal successors, (469), 329 states have internal predecessors, (469), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-08 17:49:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 563 transitions. [2024-11-08 17:49:11,752 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 563 transitions. Word has length 152 [2024-11-08 17:49:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:11,753 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 563 transitions. [2024-11-08 17:49:11,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 563 transitions. [2024-11-08 17:49:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:11,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:11,756 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:49:11,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:11,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1679286320, now seen corresponding path program 1 times [2024-11-08 17:49:11,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:11,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71989444] [2024-11-08 17:49:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:12,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:12,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71989444] [2024-11-08 17:49:12,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71989444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:12,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:12,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:49:12,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540053928] [2024-11-08 17:49:12,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:12,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:49:12,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:12,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:49:12,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:49:12,141 INFO L87 Difference]: Start difference. First operand 379 states and 563 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:12,195 INFO L93 Difference]: Finished difference Result 764 states and 1135 transitions. [2024-11-08 17:49:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:49:12,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:12,199 INFO L225 Difference]: With dead ends: 764 [2024-11-08 17:49:12,199 INFO L226 Difference]: Without dead ends: 388 [2024-11-08 17:49:12,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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:49:12,204 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:12,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-08 17:49:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-11-08 17:49:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 337 states have (on average 1.4183976261127595) internal successors, (478), 338 states have internal predecessors, (478), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-08 17:49:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 572 transitions. [2024-11-08 17:49:12,236 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 572 transitions. Word has length 153 [2024-11-08 17:49:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:12,237 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 572 transitions. [2024-11-08 17:49:12,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 572 transitions. [2024-11-08 17:49:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:12,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:12,240 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:12,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:49:12,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:12,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:12,241 INFO L85 PathProgramCache]: Analyzing trace with hash 815674821, now seen corresponding path program 1 times [2024-11-08 17:49:12,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:12,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873666231] [2024-11-08 17:49:12,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873666231] [2024-11-08 17:49:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873666231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:14,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:14,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:49:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022569257] [2024-11-08 17:49:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:14,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:49:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:14,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:49:14,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:49:14,644 INFO L87 Difference]: Start difference. First operand 388 states and 572 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:16,532 INFO L93 Difference]: Finished difference Result 1413 states and 2073 transitions. [2024-11-08 17:49:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:49:16,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:16,538 INFO L225 Difference]: With dead ends: 1413 [2024-11-08 17:49:16,538 INFO L226 Difference]: Without dead ends: 1028 [2024-11-08 17:49:16,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2024-11-08 17:49:16,540 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 1077 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:16,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1260 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 17:49:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2024-11-08 17:49:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 681. [2024-11-08 17:49:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 583 states have (on average 1.4065180102915953) internal successors, (820), 586 states have internal predecessors, (820), 88 states have call successors, (88), 9 states have call predecessors, (88), 9 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-08 17:49:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 996 transitions. [2024-11-08 17:49:16,607 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 996 transitions. Word has length 153 [2024-11-08 17:49:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:16,607 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 996 transitions. [2024-11-08 17:49:16,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 996 transitions. [2024-11-08 17:49:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:16,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:16,610 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:16,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:49:16,610 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:16,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash 228868807, now seen corresponding path program 1 times [2024-11-08 17:49:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:16,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899690517] [2024-11-08 17:49:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:18,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:18,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899690517] [2024-11-08 17:49:18,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899690517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:18,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:18,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:49:18,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997956356] [2024-11-08 17:49:18,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:18,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:49:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:18,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:49:18,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:49:18,781 INFO L87 Difference]: Start difference. First operand 681 states and 996 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:19,733 INFO L93 Difference]: Finished difference Result 1580 states and 2308 transitions. [2024-11-08 17:49:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:49:19,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:19,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:19,740 INFO L225 Difference]: With dead ends: 1580 [2024-11-08 17:49:19,740 INFO L226 Difference]: Without dead ends: 1059 [2024-11-08 17:49:19,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:49:19,743 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 458 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:19,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 639 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:49:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-08 17:49:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 923. [2024-11-08 17:49:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 805 states have (on average 1.4223602484472049) internal successors, (1145), 810 states have internal predecessors, (1145), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1357 transitions. [2024-11-08 17:49:19,867 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1357 transitions. Word has length 153 [2024-11-08 17:49:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:19,868 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1357 transitions. [2024-11-08 17:49:19,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1357 transitions. [2024-11-08 17:49:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:19,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:19,870 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:19,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:49:19,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:19,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2095538499, now seen corresponding path program 1 times [2024-11-08 17:49:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:19,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798050366] [2024-11-08 17:49:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:22,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:22,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798050366] [2024-11-08 17:49:22,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798050366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:22,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:22,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:49:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060598370] [2024-11-08 17:49:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:22,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:49:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:22,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:49:22,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:49:22,164 INFO L87 Difference]: Start difference. First operand 923 states and 1357 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:23,640 INFO L93 Difference]: Finished difference Result 1815 states and 2672 transitions. [2024-11-08 17:49:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:49:23,641 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:23,650 INFO L225 Difference]: With dead ends: 1815 [2024-11-08 17:49:23,650 INFO L226 Difference]: Without dead ends: 1291 [2024-11-08 17:49:23,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:49:23,652 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 695 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:23,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 915 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:49:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-11-08 17:49:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 923. [2024-11-08 17:49:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 805 states have (on average 1.4198757763975156) internal successors, (1143), 810 states have internal predecessors, (1143), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1355 transitions. [2024-11-08 17:49:23,760 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1355 transitions. Word has length 153 [2024-11-08 17:49:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:23,761 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1355 transitions. [2024-11-08 17:49:23,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1355 transitions. [2024-11-08 17:49:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:23,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:23,765 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:23,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:49:23,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:23,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1359816735, now seen corresponding path program 1 times [2024-11-08 17:49:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:23,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754722109] [2024-11-08 17:49:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:23,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:23,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:23,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754722109] [2024-11-08 17:49:23,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754722109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:23,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:23,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:49:23,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472667786] [2024-11-08 17:49:23,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:49:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:23,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:49:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:49:23,990 INFO L87 Difference]: Start difference. First operand 923 states and 1355 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:24,179 INFO L93 Difference]: Finished difference Result 1698 states and 2486 transitions. [2024-11-08 17:49:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:49:24,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:24,185 INFO L225 Difference]: With dead ends: 1698 [2024-11-08 17:49:24,185 INFO L226 Difference]: Without dead ends: 948 [2024-11-08 17:49:24,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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:49:24,189 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 78 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:24,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 642 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:49:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-11-08 17:49:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 908. [2024-11-08 17:49:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 790 states have (on average 1.4050632911392404) internal successors, (1110), 795 states have internal predecessors, (1110), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1322 transitions. [2024-11-08 17:49:24,282 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1322 transitions. Word has length 153 [2024-11-08 17:49:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:24,282 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1322 transitions. [2024-11-08 17:49:24,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1322 transitions. [2024-11-08 17:49:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:24,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:24,285 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:24,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:49:24,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:24,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1331481263, now seen corresponding path program 1 times [2024-11-08 17:49:24,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:24,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680850802] [2024-11-08 17:49:24,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:24,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680850802] [2024-11-08 17:49:24,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680850802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:24,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:24,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:49:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66258990] [2024-11-08 17:49:24,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:24,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:49:24,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:24,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:49:24,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:49:24,689 INFO L87 Difference]: Start difference. First operand 908 states and 1322 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:24,908 INFO L93 Difference]: Finished difference Result 1435 states and 2099 transitions. [2024-11-08 17:49:24,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:49:24,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:24,915 INFO L225 Difference]: With dead ends: 1435 [2024-11-08 17:49:24,916 INFO L226 Difference]: Without dead ends: 914 [2024-11-08 17:49:24,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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:49:24,917 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 4 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:24,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 615 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:49:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-11-08 17:49:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2024-11-08 17:49:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 792 states have (on average 1.404040404040404) internal successors, (1112), 797 states have internal predecessors, (1112), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1324 transitions. [2024-11-08 17:49:25,031 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1324 transitions. Word has length 153 [2024-11-08 17:49:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:25,031 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1324 transitions. [2024-11-08 17:49:25,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1324 transitions. [2024-11-08 17:49:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:25,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:25,035 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:25,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:49:25,035 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:25,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1269441649, now seen corresponding path program 1 times [2024-11-08 17:49:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:25,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705092935] [2024-11-08 17:49:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:26,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:26,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705092935] [2024-11-08 17:49:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705092935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:26,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:26,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:49:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280934978] [2024-11-08 17:49:26,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:26,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:49:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:26,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:49:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:49:26,830 INFO L87 Difference]: Start difference. First operand 910 states and 1324 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:27,949 INFO L93 Difference]: Finished difference Result 1607 states and 2346 transitions. [2024-11-08 17:49:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:49:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:27,956 INFO L225 Difference]: With dead ends: 1607 [2024-11-08 17:49:27,956 INFO L226 Difference]: Without dead ends: 1084 [2024-11-08 17:49:27,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:49:27,958 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 248 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:27,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1065 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:49:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-08 17:49:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 954. [2024-11-08 17:49:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 836 states have (on average 1.4090909090909092) internal successors, (1178), 841 states have internal predecessors, (1178), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1390 transitions. [2024-11-08 17:49:28,063 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1390 transitions. Word has length 153 [2024-11-08 17:49:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:28,064 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1390 transitions. [2024-11-08 17:49:28,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1390 transitions. [2024-11-08 17:49:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:28,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:28,067 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:28,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:49:28,068 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:28,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash -682635635, now seen corresponding path program 1 times [2024-11-08 17:49:28,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:28,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49270422] [2024-11-08 17:49:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:30,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:30,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49270422] [2024-11-08 17:49:30,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49270422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:30,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:30,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:49:30,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307177505] [2024-11-08 17:49:30,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:30,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:49:30,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:30,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:49:30,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:49:30,416 INFO L87 Difference]: Start difference. First operand 954 states and 1390 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:31,801 INFO L93 Difference]: Finished difference Result 1651 states and 2410 transitions. [2024-11-08 17:49:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:49:31,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:31,807 INFO L225 Difference]: With dead ends: 1651 [2024-11-08 17:49:31,807 INFO L226 Difference]: Without dead ends: 1084 [2024-11-08 17:49:31,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:49:31,809 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 335 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:31,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1074 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:49:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-08 17:49:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 954. [2024-11-08 17:49:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 836 states have (on average 1.4090909090909092) internal successors, (1178), 841 states have internal predecessors, (1178), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1390 transitions. [2024-11-08 17:49:31,927 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1390 transitions. Word has length 153 [2024-11-08 17:49:31,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:31,928 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1390 transitions. [2024-11-08 17:49:31,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1390 transitions. [2024-11-08 17:49:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:31,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:31,931 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:31,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:49:31,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:31,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash 738341897, now seen corresponding path program 1 times [2024-11-08 17:49:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:31,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944060550] [2024-11-08 17:49:31,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:33,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:33,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944060550] [2024-11-08 17:49:33,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944060550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:33,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:33,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:49:33,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694476042] [2024-11-08 17:49:33,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:33,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:49:33,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:49:33,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:49:33,793 INFO L87 Difference]: Start difference. First operand 954 states and 1390 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:35,419 INFO L93 Difference]: Finished difference Result 2018 states and 2937 transitions. [2024-11-08 17:49:35,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:49:35,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:35,426 INFO L225 Difference]: With dead ends: 2018 [2024-11-08 17:49:35,426 INFO L226 Difference]: Without dead ends: 1307 [2024-11-08 17:49:35,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:49:35,428 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 498 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:35,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1293 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:49:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2024-11-08 17:49:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 949. [2024-11-08 17:49:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 831 states have (on average 1.4067388688327316) internal successors, (1169), 836 states have internal predecessors, (1169), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1381 transitions. [2024-11-08 17:49:35,539 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1381 transitions. Word has length 153 [2024-11-08 17:49:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:35,539 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1381 transitions. [2024-11-08 17:49:35,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1381 transitions. [2024-11-08 17:49:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:35,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:35,542 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:35,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:49:35,542 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:35,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:35,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1689955707, now seen corresponding path program 1 times [2024-11-08 17:49:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:35,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884516916] [2024-11-08 17:49:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:35,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:37,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:37,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884516916] [2024-11-08 17:49:37,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884516916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:37,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:37,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:49:37,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030166870] [2024-11-08 17:49:37,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:37,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:49:37,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:37,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:49:37,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:49:37,729 INFO L87 Difference]: Start difference. First operand 949 states and 1381 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:39,575 INFO L93 Difference]: Finished difference Result 1864 states and 2722 transitions. [2024-11-08 17:49:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:49:39,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:39,581 INFO L225 Difference]: With dead ends: 1864 [2024-11-08 17:49:39,581 INFO L226 Difference]: Without dead ends: 1297 [2024-11-08 17:49:39,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:49:39,583 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 530 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:39,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1383 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:49:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2024-11-08 17:49:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 950. [2024-11-08 17:49:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 832 states have (on average 1.40625) internal successors, (1170), 837 states have internal predecessors, (1170), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1382 transitions. [2024-11-08 17:49:39,694 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1382 transitions. Word has length 153 [2024-11-08 17:49:39,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:39,695 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1382 transitions. [2024-11-08 17:49:39,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1382 transitions. [2024-11-08 17:49:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:39,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:39,698 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:39,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:49:39,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:39,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash -822008173, now seen corresponding path program 1 times [2024-11-08 17:49:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:39,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6374558] [2024-11-08 17:49:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:41,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:41,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6374558] [2024-11-08 17:49:41,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6374558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:41,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:41,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:49:41,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301605593] [2024-11-08 17:49:41,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:41,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:49:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:41,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:49:41,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:49:41,573 INFO L87 Difference]: Start difference. First operand 950 states and 1382 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:43,425 INFO L93 Difference]: Finished difference Result 2001 states and 2912 transitions. [2024-11-08 17:49:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:49:43,426 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:43,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:43,435 INFO L225 Difference]: With dead ends: 2001 [2024-11-08 17:49:43,435 INFO L226 Difference]: Without dead ends: 1302 [2024-11-08 17:49:43,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:49:43,438 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 442 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:43,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1495 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 17:49:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-11-08 17:49:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 950. [2024-11-08 17:49:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 832 states have (on average 1.4038461538461537) internal successors, (1168), 837 states have internal predecessors, (1168), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1380 transitions. [2024-11-08 17:49:43,553 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1380 transitions. Word has length 153 [2024-11-08 17:49:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:43,554 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1380 transitions. [2024-11-08 17:49:43,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1380 transitions. [2024-11-08 17:49:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:43,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:43,557 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:43,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:49:43,557 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:43,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash -235202159, now seen corresponding path program 1 times [2024-11-08 17:49:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965819325] [2024-11-08 17:49:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:46,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:46,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965819325] [2024-11-08 17:49:46,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965819325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:46,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:46,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:49:46,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101058059] [2024-11-08 17:49:46,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:46,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:49:46,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:46,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:49:46,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:49:46,851 INFO L87 Difference]: Start difference. First operand 950 states and 1380 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:49,364 INFO L93 Difference]: Finished difference Result 1899 states and 2768 transitions. [2024-11-08 17:49:49,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:49:49,365 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:49,371 INFO L225 Difference]: With dead ends: 1899 [2024-11-08 17:49:49,371 INFO L226 Difference]: Without dead ends: 1332 [2024-11-08 17:49:49,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:49:49,374 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 476 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:49,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1850 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 17:49:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2024-11-08 17:49:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 951. [2024-11-08 17:49:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 833 states have (on average 1.403361344537815) internal successors, (1169), 838 states have internal predecessors, (1169), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1381 transitions. [2024-11-08 17:49:49,479 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1381 transitions. Word has length 153 [2024-11-08 17:49:49,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:49,480 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1381 transitions. [2024-11-08 17:49:49,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1381 transitions. [2024-11-08 17:49:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 17:49:49,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:49,482 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:49,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:49:49,482 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:49,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:49,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1132881207, now seen corresponding path program 1 times [2024-11-08 17:49:49,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:49,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895422349] [2024-11-08 17:49:49,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:49,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:49,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:49,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895422349] [2024-11-08 17:49:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895422349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:49,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:49,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:49:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740727221] [2024-11-08 17:49:49,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:49,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:49:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:49,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:49:49,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:49:49,664 INFO L87 Difference]: Start difference. First operand 951 states and 1381 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:49,815 INFO L93 Difference]: Finished difference Result 1556 states and 2272 transitions. [2024-11-08 17:49:49,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:49:49,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-08 17:49:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:49,821 INFO L225 Difference]: With dead ends: 1556 [2024-11-08 17:49:49,822 INFO L226 Difference]: Without dead ends: 989 [2024-11-08 17:49:49,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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:49:49,824 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 81 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 786 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:49,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 786 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:49:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2024-11-08 17:49:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 950. [2024-11-08 17:49:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 832 states have (on average 1.4014423076923077) internal successors, (1166), 837 states have internal predecessors, (1166), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1378 transitions. [2024-11-08 17:49:49,929 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1378 transitions. Word has length 153 [2024-11-08 17:49:49,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:49,929 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1378 transitions. [2024-11-08 17:49:49,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1378 transitions. [2024-11-08 17:49:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 17:49:49,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:49,932 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:49,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:49:49,932 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:49,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:49,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1546184861, now seen corresponding path program 1 times [2024-11-08 17:49:49,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:49,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851598961] [2024-11-08 17:49:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:50,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851598961] [2024-11-08 17:49:50,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851598961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:50,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:50,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:49:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746254427] [2024-11-08 17:49:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:50,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:49:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:50,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:49:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:50,073 INFO L87 Difference]: Start difference. First operand 950 states and 1378 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:50,190 INFO L93 Difference]: Finished difference Result 1511 states and 2204 transitions. [2024-11-08 17:49:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:49:50,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-11-08 17:49:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:50,196 INFO L225 Difference]: With dead ends: 1511 [2024-11-08 17:49:50,196 INFO L226 Difference]: Without dead ends: 945 [2024-11-08 17:49:50,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:49:50,199 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 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:49:50,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:49:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-08 17:49:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2024-11-08 17:49:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 827 states have (on average 1.3978234582829505) internal successors, (1156), 832 states have internal predecessors, (1156), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1368 transitions. [2024-11-08 17:49:50,293 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1368 transitions. Word has length 154 [2024-11-08 17:49:50,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:50,293 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1368 transitions. [2024-11-08 17:49:50,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1368 transitions. [2024-11-08 17:49:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:49:50,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:50,295 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:50,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:49:50,296 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:50,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash 525472811, now seen corresponding path program 1 times [2024-11-08 17:49:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:50,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030125215] [2024-11-08 17:49:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:50,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:50,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:50,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030125215] [2024-11-08 17:49:50,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030125215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:50,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:50,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:49:50,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662579459] [2024-11-08 17:49:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:50,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:49:50,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:50,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:49:50,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:49:50,994 INFO L87 Difference]: Start difference. First operand 945 states and 1368 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:51,546 INFO L93 Difference]: Finished difference Result 1844 states and 2674 transitions. [2024-11-08 17:49:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:49:51,547 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-08 17:49:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:51,552 INFO L225 Difference]: With dead ends: 1844 [2024-11-08 17:49:51,552 INFO L226 Difference]: Without dead ends: 1175 [2024-11-08 17:49:51,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:49:51,555 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 296 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:51,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 960 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:49:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2024-11-08 17:49:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1042. [2024-11-08 17:49:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 924 states have (on average 1.405844155844156) internal successors, (1299), 929 states have internal predecessors, (1299), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1511 transitions. [2024-11-08 17:49:51,673 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1511 transitions. Word has length 155 [2024-11-08 17:49:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:51,673 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1511 transitions. [2024-11-08 17:49:51,674 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1511 transitions. [2024-11-08 17:49:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:49:51,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:51,675 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:51,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:49:51,676 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:51,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash 587512425, now seen corresponding path program 1 times [2024-11-08 17:49:51,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:51,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408817522] [2024-11-08 17:49:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:53,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:53,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408817522] [2024-11-08 17:49:53,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408817522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:53,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:53,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:49:53,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129583302] [2024-11-08 17:49:53,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:53,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:49:53,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:53,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:49:53,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:49:53,330 INFO L87 Difference]: Start difference. First operand 1042 states and 1511 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-08 17:49:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:54,804 INFO L93 Difference]: Finished difference Result 2299 states and 3313 transitions. [2024-11-08 17:49:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:49:54,807 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-08 17:49:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:54,814 INFO L225 Difference]: With dead ends: 2299 [2024-11-08 17:49:54,815 INFO L226 Difference]: Without dead ends: 1466 [2024-11-08 17:49:54,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:49:54,818 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 533 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:54,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2219 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:49:54,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2024-11-08 17:49:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1055. [2024-11-08 17:49:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 937 states have (on average 1.4055496264674494) internal successors, (1317), 942 states have internal predecessors, (1317), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1529 transitions. [2024-11-08 17:49:54,968 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1529 transitions. Word has length 155 [2024-11-08 17:49:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:54,969 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1529 transitions. [2024-11-08 17:49:54,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-08 17:49:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1529 transitions. [2024-11-08 17:49:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:49:54,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:54,971 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:54,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:49:54,971 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:54,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2039120649, now seen corresponding path program 1 times [2024-11-08 17:49:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:54,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183801392] [2024-11-08 17:49:54,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:54,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:55,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:55,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183801392] [2024-11-08 17:49:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183801392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:55,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:49:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156224239] [2024-11-08 17:49:55,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:55,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:49:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:55,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:49:55,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:49:55,284 INFO L87 Difference]: Start difference. First operand 1055 states and 1529 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:49:55,627 INFO L93 Difference]: Finished difference Result 2267 states and 3264 transitions. [2024-11-08 17:49:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:49:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-08 17:49:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:49:55,636 INFO L225 Difference]: With dead ends: 2267 [2024-11-08 17:49:55,636 INFO L226 Difference]: Without dead ends: 1486 [2024-11-08 17:49:55,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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:49:55,639 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 93 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:49:55,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 715 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:49:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-11-08 17:49:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1087. [2024-11-08 17:49:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 969 states have (on average 1.4014447884416925) internal successors, (1358), 974 states have internal predecessors, (1358), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:49:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1570 transitions. [2024-11-08 17:49:55,780 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1570 transitions. Word has length 155 [2024-11-08 17:49:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:49:55,781 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1570 transitions. [2024-11-08 17:49:55,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:49:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1570 transitions. [2024-11-08 17:49:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:49:55,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:49:55,783 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:55,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:49:55,783 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:49:55,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:49:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1452314635, now seen corresponding path program 1 times [2024-11-08 17:49:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:49:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335959711] [2024-11-08 17:49:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:49:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:49:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:49:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:49:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:49:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:49:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:49:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:49:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:49:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:49:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:49:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:49:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:49:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:49:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:49:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:49:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:49:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:49:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:49:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:49:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:49:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:49:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:49:59,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:49:59,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335959711] [2024-11-08 17:49:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335959711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:49:59,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:49:59,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-08 17:49:59,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130411403] [2024-11-08 17:49:59,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:49:59,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 17:49:59,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:49:59,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 17:49:59,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-11-08 17:49:59,607 INFO L87 Difference]: Start difference. First operand 1087 states and 1570 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:50:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:04,992 INFO L93 Difference]: Finished difference Result 2495 states and 3587 transitions. [2024-11-08 17:50:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 17:50:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-08 17:50:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:05,000 INFO L225 Difference]: With dead ends: 2495 [2024-11-08 17:50:05,000 INFO L226 Difference]: Without dead ends: 1590 [2024-11-08 17:50:05,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=389, Invalid=2061, Unknown=0, NotChecked=0, Total=2450 [2024-11-08 17:50:05,004 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 789 mSDsluCounter, 4275 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 4592 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:05,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 4592 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 17:50:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-08 17:50:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1199. [2024-11-08 17:50:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1081 states have (on average 1.4144310823311748) internal successors, (1529), 1086 states have internal predecessors, (1529), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-08 17:50:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1741 transitions. [2024-11-08 17:50:05,160 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1741 transitions. Word has length 155 [2024-11-08 17:50:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:05,161 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1741 transitions. [2024-11-08 17:50:05,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:50:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1741 transitions. [2024-11-08 17:50:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:05,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:05,163 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 17:50:05,164 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:05,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash -975982969, now seen corresponding path program 1 times [2024-11-08 17:50:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:05,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814336255] [2024-11-08 17:50:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814336255] [2024-11-08 17:50:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814336255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:06,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:06,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:50:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105154127] [2024-11-08 17:50:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:06,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:50:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:50:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:50:06,399 INFO L87 Difference]: Start difference. First operand 1199 states and 1741 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:50:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:07,062 INFO L93 Difference]: Finished difference Result 2221 states and 3215 transitions. [2024-11-08 17:50:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:50:07,063 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-08 17:50:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:07,069 INFO L225 Difference]: With dead ends: 2221 [2024-11-08 17:50:07,069 INFO L226 Difference]: Without dead ends: 1246 [2024-11-08 17:50:07,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:50:07,072 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 418 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:07,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 715 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:50:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2024-11-08 17:50:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1134. [2024-11-08 17:50:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1023 states have (on average 1.4086021505376345) internal successors, (1441), 1027 states have internal predecessors, (1441), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-11-08 17:50:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1639 transitions. [2024-11-08 17:50:07,222 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1639 transitions. Word has length 155 [2024-11-08 17:50:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:07,223 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1639 transitions. [2024-11-08 17:50:07,223 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:50:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1639 transitions. [2024-11-08 17:50:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:07,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:07,225 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:07,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:50:07,226 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:07,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:07,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1939155471, now seen corresponding path program 1 times [2024-11-08 17:50:07,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:07,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832926043] [2024-11-08 17:50:07,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:07,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832926043] [2024-11-08 17:50:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832926043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:50:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178838196] [2024-11-08 17:50:08,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:08,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:50:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:08,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:50:08,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:50:08,368 INFO L87 Difference]: Start difference. First operand 1134 states and 1639 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:50:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:09,034 INFO L93 Difference]: Finished difference Result 2246 states and 3226 transitions. [2024-11-08 17:50:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:50:09,034 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-08 17:50:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:09,044 INFO L225 Difference]: With dead ends: 2246 [2024-11-08 17:50:09,045 INFO L226 Difference]: Without dead ends: 1334 [2024-11-08 17:50:09,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:50:09,049 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 252 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:09,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 732 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:50:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-11-08 17:50:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1051. [2024-11-08 17:50:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 950 states have (on average 1.4031578947368422) internal successors, (1333), 953 states have internal predecessors, (1333), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 17:50:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1513 transitions. [2024-11-08 17:50:09,184 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1513 transitions. Word has length 155 [2024-11-08 17:50:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:09,185 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1513 transitions. [2024-11-08 17:50:09,185 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:50:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1513 transitions. [2024-11-08 17:50:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:09,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:09,187 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:09,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 17:50:09,187 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:09,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:09,187 INFO L85 PathProgramCache]: Analyzing trace with hash -489142133, now seen corresponding path program 1 times [2024-11-08 17:50:09,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:09,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462309732] [2024-11-08 17:50:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:12,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:12,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462309732] [2024-11-08 17:50:12,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462309732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:12,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:12,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-08 17:50:12,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679517608] [2024-11-08 17:50:12,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:12,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 17:50:12,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:12,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 17:50:12,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-11-08 17:50:12,292 INFO L87 Difference]: Start difference. First operand 1051 states and 1513 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:50:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:17,704 INFO L93 Difference]: Finished difference Result 2153 states and 3082 transitions. [2024-11-08 17:50:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 17:50:17,705 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-08 17:50:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:17,710 INFO L225 Difference]: With dead ends: 2153 [2024-11-08 17:50:17,711 INFO L226 Difference]: Without dead ends: 1324 [2024-11-08 17:50:17,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=389, Invalid=2061, Unknown=0, NotChecked=0, Total=2450 [2024-11-08 17:50:17,714 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 960 mSDsluCounter, 4369 mSDsCounter, 0 mSdLazyCounter, 2888 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 4689 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:17,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 4689 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2888 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 17:50:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2024-11-08 17:50:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1071. [2024-11-08 17:50:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 970 states have (on average 1.407216494845361) internal successors, (1365), 973 states have internal predecessors, (1365), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 17:50:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1545 transitions. [2024-11-08 17:50:17,841 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1545 transitions. Word has length 155 [2024-11-08 17:50:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:17,841 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1545 transitions. [2024-11-08 17:50:17,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:50:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1545 transitions. [2024-11-08 17:50:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:17,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:17,843 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:17,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 17:50:17,844 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:17,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1075948147, now seen corresponding path program 1 times [2024-11-08 17:50:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:17,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778676585] [2024-11-08 17:50:17,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:17,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:18,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778676585] [2024-11-08 17:50:18,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778676585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:18,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:18,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:50:18,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831775462] [2024-11-08 17:50:18,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:18,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:50:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:50:18,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:50:18,684 INFO L87 Difference]: Start difference. First operand 1071 states and 1545 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:50:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:19,555 INFO L93 Difference]: Finished difference Result 2078 states and 2986 transitions. [2024-11-08 17:50:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:50:19,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-08 17:50:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:19,560 INFO L225 Difference]: With dead ends: 2078 [2024-11-08 17:50:19,561 INFO L226 Difference]: Without dead ends: 1229 [2024-11-08 17:50:19,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:50:19,563 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 422 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:19,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1007 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:50:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2024-11-08 17:50:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1051. [2024-11-08 17:50:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 950 states have (on average 1.3978947368421053) internal successors, (1328), 953 states have internal predecessors, (1328), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 17:50:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1508 transitions. [2024-11-08 17:50:19,691 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1508 transitions. Word has length 155 [2024-11-08 17:50:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:19,692 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1508 transitions. [2024-11-08 17:50:19,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:50:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1508 transitions. [2024-11-08 17:50:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:19,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:19,694 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:19,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 17:50:19,694 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:19,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash -998615223, now seen corresponding path program 1 times [2024-11-08 17:50:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654870629] [2024-11-08 17:50:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:19,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654870629] [2024-11-08 17:50:19,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654870629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:19,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:19,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:50:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240139715] [2024-11-08 17:50:19,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:19,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:50:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:19,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:50:19,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:50:19,996 INFO L87 Difference]: Start difference. First operand 1051 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:50:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:20,323 INFO L93 Difference]: Finished difference Result 1858 states and 2665 transitions. [2024-11-08 17:50:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:50:20,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-08 17:50:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:20,331 INFO L225 Difference]: With dead ends: 1858 [2024-11-08 17:50:20,331 INFO L226 Difference]: Without dead ends: 989 [2024-11-08 17:50:20,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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:50:20,336 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 51 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:20,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 595 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:50:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2024-11-08 17:50:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2024-11-08 17:50:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 888 states have (on average 1.3885135135135136) internal successors, (1233), 891 states have internal predecessors, (1233), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 17:50:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1413 transitions. [2024-11-08 17:50:20,485 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1413 transitions. Word has length 155 [2024-11-08 17:50:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:20,485 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1413 transitions. [2024-11-08 17:50:20,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:50:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1413 transitions. [2024-11-08 17:50:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:20,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:20,489 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:20,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 17:50:20,489 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:20,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash 523121931, now seen corresponding path program 1 times [2024-11-08 17:50:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:20,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561172048] [2024-11-08 17:50:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:22,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561172048] [2024-11-08 17:50:22,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561172048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:22,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:22,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:50:22,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682406035] [2024-11-08 17:50:22,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:22,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:50:22,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:50:22,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:50:22,959 INFO L87 Difference]: Start difference. First operand 989 states and 1413 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:50:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:24,828 INFO L93 Difference]: Finished difference Result 2090 states and 2985 transitions. [2024-11-08 17:50:24,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:50:24,829 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-08 17:50:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:24,834 INFO L225 Difference]: With dead ends: 2090 [2024-11-08 17:50:24,834 INFO L226 Difference]: Without dead ends: 1283 [2024-11-08 17:50:24,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:50:24,837 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 513 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:24,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 2027 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:50:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-11-08 17:50:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1138. [2024-11-08 17:50:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1025 states have (on average 1.3912195121951219) internal successors, (1426), 1029 states have internal predecessors, (1426), 101 states have call successors, (101), 11 states have call predecessors, (101), 11 states have return successors, (101), 97 states have call predecessors, (101), 101 states have call successors, (101) [2024-11-08 17:50:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1628 transitions. [2024-11-08 17:50:24,976 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1628 transitions. Word has length 155 [2024-11-08 17:50:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:24,977 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1628 transitions. [2024-11-08 17:50:24,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:50:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1628 transitions. [2024-11-08 17:50:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:24,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:24,979 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 17:50:24,979 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:24,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash 781287369, now seen corresponding path program 1 times [2024-11-08 17:50:24,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:24,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598100935] [2024-11-08 17:50:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:24,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598100935] [2024-11-08 17:50:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598100935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:50:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307832984] [2024-11-08 17:50:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:26,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:50:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:26,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:50:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:50:26,440 INFO L87 Difference]: Start difference. First operand 1138 states and 1628 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-08 17:50:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:27,301 INFO L93 Difference]: Finished difference Result 2382 states and 3408 transitions. [2024-11-08 17:50:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:50:27,301 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-08 17:50:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:27,306 INFO L225 Difference]: With dead ends: 2382 [2024-11-08 17:50:27,306 INFO L226 Difference]: Without dead ends: 1426 [2024-11-08 17:50:27,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:50:27,308 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 573 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:27,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 889 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:50:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-11-08 17:50:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1200. [2024-11-08 17:50:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1087 states have (on average 1.3937442502299908) internal successors, (1515), 1091 states have internal predecessors, (1515), 101 states have call successors, (101), 11 states have call predecessors, (101), 11 states have return successors, (101), 97 states have call predecessors, (101), 101 states have call successors, (101) [2024-11-08 17:50:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1717 transitions. [2024-11-08 17:50:27,465 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1717 transitions. Word has length 155 [2024-11-08 17:50:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:27,465 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1717 transitions. [2024-11-08 17:50:27,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-08 17:50:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1717 transitions. [2024-11-08 17:50:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:27,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:27,468 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:27,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 17:50:27,468 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:27,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:27,469 INFO L85 PathProgramCache]: Analyzing trace with hash -487995319, now seen corresponding path program 1 times [2024-11-08 17:50:27,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:27,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710930414] [2024-11-08 17:50:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:27,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:27,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710930414] [2024-11-08 17:50:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710930414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:28,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:28,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:50:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551164316] [2024-11-08 17:50:28,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:28,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:50:28,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:28,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:50:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:50:28,073 INFO L87 Difference]: Start difference. First operand 1200 states and 1717 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:50:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:28,828 INFO L93 Difference]: Finished difference Result 2554 states and 3651 transitions. [2024-11-08 17:50:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:50:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-08 17:50:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:28,837 INFO L225 Difference]: With dead ends: 2554 [2024-11-08 17:50:28,838 INFO L226 Difference]: Without dead ends: 1536 [2024-11-08 17:50:28,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:50:28,842 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 255 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:28,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 867 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:50:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-08 17:50:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1530. [2024-11-08 17:50:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1377 states have (on average 1.3848946986201889) internal successors, (1907), 1385 states have internal predecessors, (1907), 137 states have call successors, (137), 15 states have call predecessors, (137), 15 states have return successors, (137), 129 states have call predecessors, (137), 137 states have call successors, (137) [2024-11-08 17:50:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2181 transitions. [2024-11-08 17:50:29,037 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2181 transitions. Word has length 155 [2024-11-08 17:50:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:29,038 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 2181 transitions. [2024-11-08 17:50:29,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:50:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2181 transitions. [2024-11-08 17:50:29,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:29,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:29,040 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:29,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 17:50:29,041 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:29,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1848617331, now seen corresponding path program 1 times [2024-11-08 17:50:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:29,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550071659] [2024-11-08 17:50:29,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:29,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:30,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550071659] [2024-11-08 17:50:30,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550071659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:30,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:30,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:50:30,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813377429] [2024-11-08 17:50:30,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:30,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:50:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:30,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:50:30,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:50:30,417 INFO L87 Difference]: Start difference. First operand 1530 states and 2181 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-08 17:50:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:31,506 INFO L93 Difference]: Finished difference Result 3015 states and 4289 transitions. [2024-11-08 17:50:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:50:31,507 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-11-08 17:50:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:31,513 INFO L225 Difference]: With dead ends: 3015 [2024-11-08 17:50:31,513 INFO L226 Difference]: Without dead ends: 1667 [2024-11-08 17:50:31,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:50:31,519 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 354 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:31,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 964 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:50:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-08 17:50:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1284. [2024-11-08 17:50:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1173 states have (on average 1.3904518329070759) internal successors, (1631), 1177 states have internal predecessors, (1631), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-08 17:50:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1825 transitions. [2024-11-08 17:50:31,740 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1825 transitions. Word has length 155 [2024-11-08 17:50:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:31,741 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1825 transitions. [2024-11-08 17:50:31,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-08 17:50:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1825 transitions. [2024-11-08 17:50:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:31,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:31,744 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:31,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 17:50:31,744 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:31,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1590451893, now seen corresponding path program 1 times [2024-11-08 17:50:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:31,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738952771] [2024-11-08 17:50:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:31,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:54,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:54,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738952771] [2024-11-08 17:50:54,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738952771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:54,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:54,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:50:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547769475] [2024-11-08 17:50:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:54,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:50:54,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:54,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:50:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:50:54,140 INFO L87 Difference]: Start difference. First operand 1284 states and 1825 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:50:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:57,719 INFO L93 Difference]: Finished difference Result 2539 states and 3600 transitions. [2024-11-08 17:50:57,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:50:57,720 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-08 17:50:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:57,725 INFO L225 Difference]: With dead ends: 2539 [2024-11-08 17:50:57,725 INFO L226 Difference]: Without dead ends: 1437 [2024-11-08 17:50:57,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2024-11-08 17:50:57,727 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 241 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:57,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 2110 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:50:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2024-11-08 17:50:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1280. [2024-11-08 17:50:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1169 states have (on average 1.3892215568862276) internal successors, (1624), 1173 states have internal predecessors, (1624), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-08 17:50:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1818 transitions. [2024-11-08 17:50:57,963 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1818 transitions. Word has length 155 [2024-11-08 17:50:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:57,964 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1818 transitions. [2024-11-08 17:50:57,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:50:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1818 transitions. [2024-11-08 17:50:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:57,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:57,966 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:57,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 17:50:57,966 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:57,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1909325325, now seen corresponding path program 1 times [2024-11-08 17:50:57,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:57,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250332283] [2024-11-08 17:50:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:57,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:50:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:50:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:50:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:50:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:50:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:50:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:50:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:50:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:50:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:50:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:50:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:50:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:50:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:50:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:50:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:50:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:50:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:50:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:50:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:50:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:50:58,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:50:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250332283] [2024-11-08 17:50:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250332283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:50:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:50:58,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:50:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493511329] [2024-11-08 17:50:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:50:58,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:50:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:50:58,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:50:58,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:50:58,644 INFO L87 Difference]: Start difference. First operand 1280 states and 1818 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:50:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:50:59,561 INFO L93 Difference]: Finished difference Result 2463 states and 3493 transitions. [2024-11-08 17:50:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:50:59,561 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-08 17:50:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:50:59,567 INFO L225 Difference]: With dead ends: 2463 [2024-11-08 17:50:59,567 INFO L226 Difference]: Without dead ends: 1365 [2024-11-08 17:50:59,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:50:59,569 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 568 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:50:59,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 609 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:50:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-11-08 17:50:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1155. [2024-11-08 17:50:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1066 states have (on average 1.3921200750469043) internal successors, (1484), 1068 states have internal predecessors, (1484), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:50:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1638 transitions. [2024-11-08 17:50:59,819 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1638 transitions. Word has length 155 [2024-11-08 17:50:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:50:59,820 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1638 transitions. [2024-11-08 17:50:59,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:50:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1638 transitions. [2024-11-08 17:50:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:50:59,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:50:59,822 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:59,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 17:50:59,822 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:50:59,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:50:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash 898208075, now seen corresponding path program 1 times [2024-11-08 17:50:59,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:50:59,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887690959] [2024-11-08 17:50:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:50:59,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:50:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:01,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887690959] [2024-11-08 17:51:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887690959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:01,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:01,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:51:01,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567158743] [2024-11-08 17:51:01,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:01,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:51:01,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:01,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:51:01,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:51:01,671 INFO L87 Difference]: Start difference. First operand 1155 states and 1638 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:51:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:03,554 INFO L93 Difference]: Finished difference Result 2274 states and 3220 transitions. [2024-11-08 17:51:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:51:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-08 17:51:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:03,558 INFO L225 Difference]: With dead ends: 2274 [2024-11-08 17:51:03,559 INFO L226 Difference]: Without dead ends: 1301 [2024-11-08 17:51:03,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:51:03,561 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 323 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:03,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 2215 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:51:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2024-11-08 17:51:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1149. [2024-11-08 17:51:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1060 states have (on average 1.3943396226415095) internal successors, (1478), 1062 states have internal predecessors, (1478), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1632 transitions. [2024-11-08 17:51:03,800 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1632 transitions. Word has length 155 [2024-11-08 17:51:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:03,801 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1632 transitions. [2024-11-08 17:51:03,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:51:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1632 transitions. [2024-11-08 17:51:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:51:03,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:03,803 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:03,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-08 17:51:03,803 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:03,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1215365749, now seen corresponding path program 1 times [2024-11-08 17:51:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:03,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669315149] [2024-11-08 17:51:03,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:06,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669315149] [2024-11-08 17:51:06,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669315149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:06,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:06,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 17:51:06,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238975] [2024-11-08 17:51:06,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:06,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:51:06,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:06,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:51:06,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:51:06,989 INFO L87 Difference]: Start difference. First operand 1149 states and 1632 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:51:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:10,253 INFO L93 Difference]: Finished difference Result 2255 states and 3199 transitions. [2024-11-08 17:51:10,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:51:10,253 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-11-08 17:51:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:10,256 INFO L225 Difference]: With dead ends: 2255 [2024-11-08 17:51:10,257 INFO L226 Difference]: Without dead ends: 1288 [2024-11-08 17:51:10,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2024-11-08 17:51:10,258 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 238 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:10,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 2308 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 17:51:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-11-08 17:51:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1140. [2024-11-08 17:51:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1051 states have (on average 1.39581351094196) internal successors, (1467), 1053 states have internal predecessors, (1467), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1621 transitions. [2024-11-08 17:51:10,447 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1621 transitions. Word has length 155 [2024-11-08 17:51:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:10,448 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1621 transitions. [2024-11-08 17:51:10,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:51:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1621 transitions. [2024-11-08 17:51:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:51:10,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:10,450 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:10,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 17:51:10,450 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:10,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash -736769525, now seen corresponding path program 1 times [2024-11-08 17:51:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:10,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142528458] [2024-11-08 17:51:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:10,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:10,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142528458] [2024-11-08 17:51:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142528458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:10,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:10,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:51:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506206270] [2024-11-08 17:51:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:10,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:51:10,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:51:10,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:51:10,560 INFO L87 Difference]: Start difference. First operand 1140 states and 1621 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:10,784 INFO L93 Difference]: Finished difference Result 2111 states and 3006 transitions. [2024-11-08 17:51:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:51:10,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-08 17:51:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:10,789 INFO L225 Difference]: With dead ends: 2111 [2024-11-08 17:51:10,790 INFO L226 Difference]: Without dead ends: 1148 [2024-11-08 17:51:10,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:51:10,792 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:10,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:51:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2024-11-08 17:51:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2024-11-08 17:51:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1059 states have (on average 1.392823418319169) internal successors, (1475), 1061 states have internal predecessors, (1475), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1629 transitions. [2024-11-08 17:51:11,018 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1629 transitions. Word has length 156 [2024-11-08 17:51:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:11,019 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1629 transitions. [2024-11-08 17:51:11,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1629 transitions. [2024-11-08 17:51:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:51:11,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:11,021 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:11,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 17:51:11,022 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:11,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:11,022 INFO L85 PathProgramCache]: Analyzing trace with hash -478604087, now seen corresponding path program 1 times [2024-11-08 17:51:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376083335] [2024-11-08 17:51:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:11,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376083335] [2024-11-08 17:51:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376083335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:11,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:11,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:51:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61594910] [2024-11-08 17:51:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:11,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:51:11,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:11,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:51:11,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:51:11,270 INFO L87 Difference]: Start difference. First operand 1148 states and 1629 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:11,515 INFO L93 Difference]: Finished difference Result 2145 states and 3039 transitions. [2024-11-08 17:51:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:51:11,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-08 17:51:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:11,520 INFO L225 Difference]: With dead ends: 2145 [2024-11-08 17:51:11,521 INFO L226 Difference]: Without dead ends: 1180 [2024-11-08 17:51:11,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:51:11,523 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:11,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 859 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:51:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-11-08 17:51:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1156. [2024-11-08 17:51:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1067 states have (on average 1.3898781630740393) internal successors, (1483), 1069 states have internal predecessors, (1483), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1637 transitions. [2024-11-08 17:51:11,753 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1637 transitions. Word has length 156 [2024-11-08 17:51:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:11,758 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1637 transitions. [2024-11-08 17:51:11,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1637 transitions. [2024-11-08 17:51:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:51:11,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:11,760 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:11,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 17:51:11,760 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:11,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1970680058, now seen corresponding path program 1 times [2024-11-08 17:51:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:11,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584189980] [2024-11-08 17:51:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:11,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:12,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:12,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584189980] [2024-11-08 17:51:12,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584189980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:12,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:12,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:51:12,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229045976] [2024-11-08 17:51:12,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:12,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:51:12,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:12,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:51:12,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:51:12,036 INFO L87 Difference]: Start difference. First operand 1156 states and 1637 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:12,353 INFO L93 Difference]: Finished difference Result 2521 states and 3483 transitions. [2024-11-08 17:51:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:51:12,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-08 17:51:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:12,357 INFO L225 Difference]: With dead ends: 2521 [2024-11-08 17:51:12,357 INFO L226 Difference]: Without dead ends: 1541 [2024-11-08 17:51:12,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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:51:12,359 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 53 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:12,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 631 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:51:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-11-08 17:51:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1405. [2024-11-08 17:51:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1316 states have (on average 1.330547112462006) internal successors, (1751), 1318 states have internal predecessors, (1751), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1905 transitions. [2024-11-08 17:51:12,547 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1905 transitions. Word has length 158 [2024-11-08 17:51:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:12,547 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1905 transitions. [2024-11-08 17:51:12,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1905 transitions. [2024-11-08 17:51:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:51:12,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:12,550 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:12,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 17:51:12,550 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:12,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:12,551 INFO L85 PathProgramCache]: Analyzing trace with hash -347024469, now seen corresponding path program 1 times [2024-11-08 17:51:12,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:12,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055080391] [2024-11-08 17:51:12,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:12,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:12,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:12,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055080391] [2024-11-08 17:51:12,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055080391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:12,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:12,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:51:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456133314] [2024-11-08 17:51:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:12,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:51:12,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:12,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:51:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:51:12,684 INFO L87 Difference]: Start difference. First operand 1405 states and 1905 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:12,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:12,919 INFO L93 Difference]: Finished difference Result 2600 states and 3527 transitions. [2024-11-08 17:51:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:51:12,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-08 17:51:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:12,924 INFO L225 Difference]: With dead ends: 2600 [2024-11-08 17:51:12,924 INFO L226 Difference]: Without dead ends: 1409 [2024-11-08 17:51:12,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:51:12,926 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:12,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:51:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-11-08 17:51:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1409. [2024-11-08 17:51:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1320 states have (on average 1.3295454545454546) internal successors, (1755), 1322 states have internal predecessors, (1755), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1909 transitions. [2024-11-08 17:51:13,146 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1909 transitions. Word has length 158 [2024-11-08 17:51:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:13,147 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1909 transitions. [2024-11-08 17:51:13,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1909 transitions. [2024-11-08 17:51:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:51:13,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:13,149 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:13,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-08 17:51:13,150 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:13,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1427982893, now seen corresponding path program 1 times [2024-11-08 17:51:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:13,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599895905] [2024-11-08 17:51:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:13,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:13,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:13,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599895905] [2024-11-08 17:51:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599895905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:13,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:51:13,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291308280] [2024-11-08 17:51:13,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:13,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:51:13,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:13,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:51:13,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:51:13,792 INFO L87 Difference]: Start difference. First operand 1409 states and 1909 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:14,249 INFO L93 Difference]: Finished difference Result 2266 states and 2997 transitions. [2024-11-08 17:51:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:51:14,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-11-08 17:51:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:14,253 INFO L225 Difference]: With dead ends: 2266 [2024-11-08 17:51:14,253 INFO L226 Difference]: Without dead ends: 2264 [2024-11-08 17:51:14,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:51:14,254 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 259 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:14,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 953 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:51:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-11-08 17:51:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2206. [2024-11-08 17:51:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 2117 states have (on average 1.3060935285781767) internal successors, (2765), 2119 states have internal predecessors, (2765), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2919 transitions. [2024-11-08 17:51:14,402 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2919 transitions. Word has length 158 [2024-11-08 17:51:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:14,402 INFO L471 AbstractCegarLoop]: Abstraction has 2206 states and 2919 transitions. [2024-11-08 17:51:14,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2919 transitions. [2024-11-08 17:51:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:51:14,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:14,405 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:14,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 17:51:14,405 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:14,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1533655639, now seen corresponding path program 1 times [2024-11-08 17:51:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:14,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444043087] [2024-11-08 17:51:14,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:14,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444043087] [2024-11-08 17:51:15,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444043087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:15,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:15,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:51:15,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525574887] [2024-11-08 17:51:15,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:15,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:51:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:15,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:51:15,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:51:15,251 INFO L87 Difference]: Start difference. First operand 2206 states and 2919 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:16,227 INFO L93 Difference]: Finished difference Result 4282 states and 5670 transitions. [2024-11-08 17:51:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:51:16,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 159 [2024-11-08 17:51:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:16,234 INFO L225 Difference]: With dead ends: 4282 [2024-11-08 17:51:16,234 INFO L226 Difference]: Without dead ends: 2387 [2024-11-08 17:51:16,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:51:16,237 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 215 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:16,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 970 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:51:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2024-11-08 17:51:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2108. [2024-11-08 17:51:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2019 states have (on average 1.303615651312531) internal successors, (2632), 2021 states have internal predecessors, (2632), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 2786 transitions. [2024-11-08 17:51:16,494 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 2786 transitions. Word has length 159 [2024-11-08 17:51:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:16,497 INFO L471 AbstractCegarLoop]: Abstraction has 2108 states and 2786 transitions. [2024-11-08 17:51:16,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2786 transitions. [2024-11-08 17:51:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:51:16,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:16,500 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:16,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-08 17:51:16,500 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1714673391, now seen corresponding path program 1 times [2024-11-08 17:51:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:16,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351029893] [2024-11-08 17:51:16,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:17,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351029893] [2024-11-08 17:51:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351029893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:17,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:17,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:51:17,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654770672] [2024-11-08 17:51:17,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:17,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:51:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:17,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:51:17,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:51:17,600 INFO L87 Difference]: Start difference. First operand 2108 states and 2786 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:51:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:18,185 INFO L93 Difference]: Finished difference Result 5641 states and 7416 transitions. [2024-11-08 17:51:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:51:18,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 160 [2024-11-08 17:51:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:18,195 INFO L225 Difference]: With dead ends: 5641 [2024-11-08 17:51:18,196 INFO L226 Difference]: Without dead ends: 3754 [2024-11-08 17:51:18,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:51:18,199 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 352 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:18,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 930 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:51:18,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2024-11-08 17:51:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 2962. [2024-11-08 17:51:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2962 states, 2873 states have (on average 1.3111729899060216) internal successors, (3767), 2875 states have internal predecessors, (3767), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 3921 transitions. [2024-11-08 17:51:18,466 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 3921 transitions. Word has length 160 [2024-11-08 17:51:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:18,466 INFO L471 AbstractCegarLoop]: Abstraction has 2962 states and 3921 transitions. [2024-11-08 17:51:18,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:51:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 3921 transitions. [2024-11-08 17:51:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:51:18,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:18,470 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:18,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 17:51:18,471 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:18,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash -328469997, now seen corresponding path program 1 times [2024-11-08 17:51:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:18,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342655906] [2024-11-08 17:51:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:19,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:19,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342655906] [2024-11-08 17:51:19,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342655906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:19,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:19,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:51:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588779835] [2024-11-08 17:51:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:19,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:51:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:19,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:51:19,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:51:19,082 INFO L87 Difference]: Start difference. First operand 2962 states and 3921 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:19,569 INFO L93 Difference]: Finished difference Result 6425 states and 8453 transitions. [2024-11-08 17:51:19,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:51:19,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-08 17:51:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:19,575 INFO L225 Difference]: With dead ends: 6425 [2024-11-08 17:51:19,575 INFO L226 Difference]: Without dead ends: 3758 [2024-11-08 17:51:19,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:51:19,579 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 276 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:19,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 675 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:51:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2024-11-08 17:51:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 2958. [2024-11-08 17:51:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2869 states have (on average 1.3102126176368072) internal successors, (3759), 2871 states have internal predecessors, (3759), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3913 transitions. [2024-11-08 17:51:19,851 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3913 transitions. Word has length 160 [2024-11-08 17:51:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:19,852 INFO L471 AbstractCegarLoop]: Abstraction has 2958 states and 3913 transitions. [2024-11-08 17:51:19,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3913 transitions. [2024-11-08 17:51:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:51:19,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:19,855 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:19,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-08 17:51:19,856 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:19,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1717848786, now seen corresponding path program 1 times [2024-11-08 17:51:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810757162] [2024-11-08 17:51:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:19,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810757162] [2024-11-08 17:51:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810757162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:20,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:51:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742760766] [2024-11-08 17:51:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:20,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:51:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:51:20,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:51:20,122 INFO L87 Difference]: Start difference. First operand 2958 states and 3913 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:20,387 INFO L93 Difference]: Finished difference Result 5702 states and 7532 transitions. [2024-11-08 17:51:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:51:20,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-11-08 17:51:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:20,395 INFO L225 Difference]: With dead ends: 5702 [2024-11-08 17:51:20,395 INFO L226 Difference]: Without dead ends: 2958 [2024-11-08 17:51:20,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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:51:20,399 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:20,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:51:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2024-11-08 17:51:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2958. [2024-11-08 17:51:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2869 states have (on average 1.2474729871035204) internal successors, (3579), 2871 states have internal predecessors, (3579), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3733 transitions. [2024-11-08 17:51:20,586 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3733 transitions. Word has length 160 [2024-11-08 17:51:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:20,587 INFO L471 AbstractCegarLoop]: Abstraction has 2958 states and 3733 transitions. [2024-11-08 17:51:20,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3733 transitions. [2024-11-08 17:51:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 17:51:20,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:20,590 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:20,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-08 17:51:20,591 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:20,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1864599711, now seen corresponding path program 1 times [2024-11-08 17:51:20,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:20,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895408715] [2024-11-08 17:51:20,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:20,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:21,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895408715] [2024-11-08 17:51:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895408715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:21,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:21,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:51:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606311106] [2024-11-08 17:51:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:51:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:51:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:51:21,402 INFO L87 Difference]: Start difference. First operand 2958 states and 3733 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-08 17:51:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:21,924 INFO L93 Difference]: Finished difference Result 5679 states and 7164 transitions. [2024-11-08 17:51:21,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:51:21,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 161 [2024-11-08 17:51:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:21,929 INFO L225 Difference]: With dead ends: 5679 [2024-11-08 17:51:21,929 INFO L226 Difference]: Without dead ends: 3016 [2024-11-08 17:51:21,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:51:21,933 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 443 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:21,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 644 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:51:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2024-11-08 17:51:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 2958. [2024-11-08 17:51:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2869 states have (on average 1.2446845590798188) internal successors, (3571), 2871 states have internal predecessors, (3571), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3725 transitions. [2024-11-08 17:51:22,235 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3725 transitions. Word has length 161 [2024-11-08 17:51:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:22,236 INFO L471 AbstractCegarLoop]: Abstraction has 2958 states and 3725 transitions. [2024-11-08 17:51:22,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-08 17:51:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3725 transitions. [2024-11-08 17:51:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 17:51:22,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:22,240 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:22,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-08 17:51:22,243 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:22,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2037340575, now seen corresponding path program 1 times [2024-11-08 17:51:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:22,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4456897] [2024-11-08 17:51:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:22,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:22,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4456897] [2024-11-08 17:51:22,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4456897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:22,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:22,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:51:22,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917352617] [2024-11-08 17:51:22,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:22,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:51:22,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:22,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:51:22,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:51:22,784 INFO L87 Difference]: Start difference. First operand 2958 states and 3725 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:23,187 INFO L93 Difference]: Finished difference Result 5647 states and 7104 transitions. [2024-11-08 17:51:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:51:23,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-08 17:51:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:23,193 INFO L225 Difference]: With dead ends: 5647 [2024-11-08 17:51:23,193 INFO L226 Difference]: Without dead ends: 2984 [2024-11-08 17:51:23,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:51:23,197 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 286 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:23,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 538 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:51:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2024-11-08 17:51:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2958. [2024-11-08 17:51:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2869 states have (on average 1.243290345067968) internal successors, (3567), 2871 states have internal predecessors, (3567), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3721 transitions. [2024-11-08 17:51:23,485 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3721 transitions. Word has length 161 [2024-11-08 17:51:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:23,489 INFO L471 AbstractCegarLoop]: Abstraction has 2958 states and 3721 transitions. [2024-11-08 17:51:23,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3721 transitions. [2024-11-08 17:51:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 17:51:23,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:23,494 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:23,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-08 17:51:23,494 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1347791550, now seen corresponding path program 1 times [2024-11-08 17:51:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:23,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780716534] [2024-11-08 17:51:23,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:23,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:23,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:23,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780716534] [2024-11-08 17:51:23,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780716534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:23,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:23,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:51:23,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975481185] [2024-11-08 17:51:23,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:23,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:51:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:23,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:51:23,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:51:23,933 INFO L87 Difference]: Start difference. First operand 2958 states and 3721 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:24,610 INFO L93 Difference]: Finished difference Result 4924 states and 6175 transitions. [2024-11-08 17:51:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:51:24,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-08 17:51:24,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:24,615 INFO L225 Difference]: With dead ends: 4924 [2024-11-08 17:51:24,615 INFO L226 Difference]: Without dead ends: 3162 [2024-11-08 17:51:24,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:51:24,618 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 309 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:24,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 593 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:51:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2024-11-08 17:51:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 2958. [2024-11-08 17:51:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2869 states have (on average 1.2296967584524225) internal successors, (3528), 2871 states have internal predecessors, (3528), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3682 transitions. [2024-11-08 17:51:24,793 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3682 transitions. Word has length 161 [2024-11-08 17:51:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:24,793 INFO L471 AbstractCegarLoop]: Abstraction has 2958 states and 3682 transitions. [2024-11-08 17:51:24,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3682 transitions. [2024-11-08 17:51:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 17:51:24,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:24,797 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:24,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-08 17:51:24,797 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:24,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:24,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1481805056, now seen corresponding path program 1 times [2024-11-08 17:51:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:24,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791670133] [2024-11-08 17:51:24,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:25,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:25,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791670133] [2024-11-08 17:51:25,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791670133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:25,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:25,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:51:25,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943769136] [2024-11-08 17:51:25,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:25,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:51:25,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:25,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:51:25,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:51:25,274 INFO L87 Difference]: Start difference. First operand 2958 states and 3682 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:25,902 INFO L93 Difference]: Finished difference Result 4810 states and 5995 transitions. [2024-11-08 17:51:25,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:51:25,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-08 17:51:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:25,907 INFO L225 Difference]: With dead ends: 4810 [2024-11-08 17:51:25,907 INFO L226 Difference]: Without dead ends: 3162 [2024-11-08 17:51:25,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:51:25,909 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 289 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:25,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 592 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:51:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2024-11-08 17:51:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 2958. [2024-11-08 17:51:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2869 states have (on average 1.2265597769257581) internal successors, (3519), 2871 states have internal predecessors, (3519), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3673 transitions. [2024-11-08 17:51:26,089 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3673 transitions. Word has length 161 [2024-11-08 17:51:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:26,089 INFO L471 AbstractCegarLoop]: Abstraction has 2958 states and 3673 transitions. [2024-11-08 17:51:26,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3673 transitions. [2024-11-08 17:51:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 17:51:26,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:26,091 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:26,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-08 17:51:26,092 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:26,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:26,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1223639618, now seen corresponding path program 1 times [2024-11-08 17:51:26,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:26,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834665689] [2024-11-08 17:51:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:26,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:26,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834665689] [2024-11-08 17:51:26,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834665689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:26,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:26,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:51:26,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346847438] [2024-11-08 17:51:26,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:26,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:51:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:26,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:51:26,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:51:26,306 INFO L87 Difference]: Start difference. First operand 2958 states and 3673 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:26,520 INFO L93 Difference]: Finished difference Result 5693 states and 7067 transitions. [2024-11-08 17:51:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:51:26,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-11-08 17:51:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:26,526 INFO L225 Difference]: With dead ends: 5693 [2024-11-08 17:51:26,526 INFO L226 Difference]: Without dead ends: 3030 [2024-11-08 17:51:26,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:51:26,530 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:26,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1013 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:51:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2024-11-08 17:51:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2946. [2024-11-08 17:51:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2857 states have (on average 1.2264613230661534) internal successors, (3504), 2859 states have internal predecessors, (3504), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-08 17:51:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3658 transitions. [2024-11-08 17:51:26,749 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3658 transitions. Word has length 161 [2024-11-08 17:51:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:26,749 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 3658 transitions. [2024-11-08 17:51:26,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3658 transitions. [2024-11-08 17:51:26,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 17:51:26,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:26,751 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:26,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-08 17:51:26,751 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:26,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1073031936, now seen corresponding path program 1 times [2024-11-08 17:51:26,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:26,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724045164] [2024-11-08 17:51:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:26,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-08 17:51:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:27,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724045164] [2024-11-08 17:51:27,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724045164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:51:27,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148860141] [2024-11-08 17:51:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:27,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:51:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:51:27,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:51:27,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:51:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:27,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 17:51:27,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:51:28,308 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:51:28,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 17:51:29,551 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 17:51:29,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2024-11-08 17:51:29,678 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 17:51:29,678 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 28 treesize of output 12 [2024-11-08 17:51:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 312 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-08 17:51:29,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:51:30,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148860141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:51:30,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:51:30,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2024-11-08 17:51:30,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225906423] [2024-11-08 17:51:30,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:51:30,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 17:51:30,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:30,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 17:51:30,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:51:30,182 INFO L87 Difference]: Start difference. First operand 2946 states and 3658 transitions. Second operand has 19 states, 17 states have (on average 7.823529411764706) internal successors, (133), 17 states have internal predecessors, (133), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-08 17:51:31,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:31,312 INFO L93 Difference]: Finished difference Result 6206 states and 7651 transitions. [2024-11-08 17:51:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:51:31,313 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.823529411764706) internal successors, (133), 17 states have internal predecessors, (133), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 161 [2024-11-08 17:51:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:31,317 INFO L225 Difference]: With dead ends: 6206 [2024-11-08 17:51:31,317 INFO L226 Difference]: Without dead ends: 3384 [2024-11-08 17:51:31,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 310 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2024-11-08 17:51:31,320 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 482 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:31,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1351 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:51:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2024-11-08 17:51:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3352. [2024-11-08 17:51:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3242 states have (on average 1.189697717458359) internal successors, (3857), 3248 states have internal predecessors, (3857), 93 states have call successors, (93), 16 states have call predecessors, (93), 16 states have return successors, (93), 87 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 17:51:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4043 transitions. [2024-11-08 17:51:31,577 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4043 transitions. Word has length 161 [2024-11-08 17:51:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:31,577 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4043 transitions. [2024-11-08 17:51:31,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.823529411764706) internal successors, (133), 17 states have internal predecessors, (133), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-08 17:51:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4043 transitions. [2024-11-08 17:51:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:51:31,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:31,581 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:31,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:51:31,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2024-11-08 17:51:31,782 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:31,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:31,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1254129149, now seen corresponding path program 1 times [2024-11-08 17:51:31,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:31,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198095793] [2024-11-08 17:51:31,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:31,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:51:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:51:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:51:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:51:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:51:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:51:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:51:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:51:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:51:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:51:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:51:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:51:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 17:51:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 17:51:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 17:51:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 17:51:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 17:51:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 17:51:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:51:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:33,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:51:33,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198095793] [2024-11-08 17:51:33,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198095793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:33,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:51:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068869699] [2024-11-08 17:51:33,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:33,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:51:33,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:51:33,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:51:33,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:51:33,089 INFO L87 Difference]: Start difference. First operand 3352 states and 4043 transitions. Second operand has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:51:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:34,393 INFO L93 Difference]: Finished difference Result 3600 states and 4334 transitions. [2024-11-08 17:51:34,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:51:34,394 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 163 [2024-11-08 17:51:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:34,400 INFO L225 Difference]: With dead ends: 3600 [2024-11-08 17:51:34,400 INFO L226 Difference]: Without dead ends: 3598 [2024-11-08 17:51:34,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2024-11-08 17:51:34,403 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 453 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:34,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1622 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:51:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2024-11-08 17:51:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 3590. [2024-11-08 17:51:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3590 states, 3468 states have (on average 1.1882929642445212) internal successors, (4121), 3478 states have internal predecessors, (4121), 101 states have call successors, (101), 20 states have call predecessors, (101), 20 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) [2024-11-08 17:51:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 4323 transitions. [2024-11-08 17:51:34,816 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 4323 transitions. Word has length 163 [2024-11-08 17:51:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:34,816 INFO L471 AbstractCegarLoop]: Abstraction has 3590 states and 4323 transitions. [2024-11-08 17:51:34,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:51:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 4323 transitions. [2024-11-08 17:51:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:51:34,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:34,819 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:34,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-08 17:51:34,819 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:34,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -473045988, now seen corresponding path program 1 times [2024-11-08 17:51:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:51:34,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026588291] [2024-11-08 17:51:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:51:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:51:34,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:51:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:51:35,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:51:35,123 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:51:35,124 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:51:35,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-08 17:51:35,129 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:51:35,331 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:51:35,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:51:35 BoogieIcfgContainer [2024-11-08 17:51:35,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:51:35,335 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:51:35,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:51:35,336 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:51:35,337 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:49:03" (3/4) ... [2024-11-08 17:51:35,339 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:51:35,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:51:35,341 INFO L158 Benchmark]: Toolchain (without parser) took 153204.12ms. Allocated memory was 165.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 126.5MB in the beginning and 1.1GB in the end (delta: -970.7MB). Peak memory consumption was 216.6MB. Max. memory is 16.1GB. [2024-11-08 17:51:35,341 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:51:35,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.96ms. Allocated memory is still 165.7MB. Free memory was 126.2MB in the beginning and 108.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 17:51:35,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.30ms. Allocated memory is still 165.7MB. Free memory was 108.3MB in the beginning and 103.4MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 17:51:35,345 INFO L158 Benchmark]: Boogie Preprocessor took 86.88ms. Allocated memory is still 165.7MB. Free memory was 103.4MB in the beginning and 98.1MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:51:35,345 INFO L158 Benchmark]: RCFGBuilder took 1135.43ms. Allocated memory was 165.7MB in the beginning and 216.0MB in the end (delta: 50.3MB). Free memory was 98.1MB in the beginning and 170.7MB in the end (delta: -72.6MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2024-11-08 17:51:35,345 INFO L158 Benchmark]: TraceAbstraction took 151427.72ms. Allocated memory was 216.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 170.7MB in the beginning and 1.1GB in the end (delta: -926.5MB). Peak memory consumption was 210.2MB. Max. memory is 16.1GB. [2024-11-08 17:51:35,345 INFO L158 Benchmark]: Witness Printer took 5.54ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:51:35,346 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.19ms. Allocated memory is still 165.7MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.96ms. Allocated memory is still 165.7MB. Free memory was 126.2MB in the beginning and 108.3MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.30ms. Allocated memory is still 165.7MB. Free memory was 108.3MB in the beginning and 103.4MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.88ms. Allocated memory is still 165.7MB. Free memory was 103.4MB in the beginning and 98.1MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1135.43ms. Allocated memory was 165.7MB in the beginning and 216.0MB in the end (delta: 50.3MB). Free memory was 98.1MB in the beginning and 170.7MB in the end (delta: -72.6MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * TraceAbstraction took 151427.72ms. Allocated memory was 216.0MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 170.7MB in the beginning and 1.1GB in the end (delta: -926.5MB). Peak memory consumption was 210.2MB. Max. memory is 16.1GB. * Witness Printer took 5.54ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[2]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[3]); [L29] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer = &(BOOL_unsigned_char_Array_0[4]); [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L33] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L35-L37] signed char signed_char_Array_0[1] = { 0 }; [L35-L37] signed char signed_char_Array_0[1] = { 0 }; [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0][0]); [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1][0]); [L44] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[0][1]); [L45] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer = &(unsigned_char_Array_0[1][1]); [L46] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer = &(unsigned_char_Array_0[0][2]); [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer = &(unsigned_char_Array_0[1][2]); [L48] unsigned char last_1_unsigned_char_Array_0_0__1_ = 64; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=0, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L115] EXPR unsigned_char_Array_0[0][1] [L115] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L84] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L85] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L85] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L85] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L87] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L88] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L90] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L91] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L91] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L91] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L93] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L94] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L94] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L94] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L96] double_Array_0[1] = __VERIFIER_nondet_double() [L97] EXPR double_Array_0[1] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L97] EXPR double_Array_0[1] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L98] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L99] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L99] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L99] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] CALL assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] RET assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L101] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L102] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L102] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L102] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L104] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L107] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L108] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L108] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L108] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L110] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L111] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L111] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L111] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L126] RET updateVariables() [L127] CALL step() [L52] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L52] EXPR last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L52] COND TRUE (last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_ [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L53] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) = (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L57] COND FALSE !(((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L60] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L60] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L61] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L61] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L61] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) [L68] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L68] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) [L73] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L73] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)); [L74] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L74] unsigned char stepLocal_0 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)); [L75] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L75] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L76] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, stepLocal_1=64, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L76] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L76] COND TRUE stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L77] COND TRUE stepLocal_1 > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) [L78] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L78] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L118] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L118] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1 [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1 [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1 [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L118] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118-L119] return (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 151.1s, OverallIterations: 54, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 57.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16183 SdHoareTripleChecker+Valid, 33.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16158 mSDsluCounter, 59185 SdHoareTripleChecker+Invalid, 29.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48665 mSDsCounter, 2041 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27906 IncrementalHoareTripleChecker+Invalid, 29947 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2041 mSolverCounterUnsat, 10520 mSDtfsCounter, 27906 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3154 GetRequests, 2482 SyntacticMatches, 4 SemanticMatches, 668 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2614 ImplicationChecksByTransitivity, 23.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3590occurred in iteration=53, InterpolantAutomatonStates: 478, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 53 MinimizatonAttempts, 9147 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 80.2s InterpolantComputationTime, 8565 NumberOfCodeBlocks, 8565 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 8348 ConstructedInterpolants, 0 QuantifiedInterpolants, 68512 SizeOfPredicates, 8 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 54 InterpolantComputations, 52 PerfectInterpolantSequences, 36585/36936 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:51:35,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:51:38,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:51:38,144 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:51:38,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:51:38,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:51:38,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:51:38,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:51:38,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:51:38,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:51:38,203 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:51:38,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:51:38,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:51:38,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:51:38,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:51:38,206 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:51:38,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:51:38,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:51:38,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:51:38,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:51:38,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:51:38,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:51:38,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:51:38,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:51:38,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:51:38,216 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:51:38,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:51:38,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:51:38,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:51:38,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:51:38,218 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:51:38,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:51:38,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:51:38,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:51:38,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:51:38,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:51:38,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:51:38,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:51:38,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:51:38,225 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:51:38,225 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:51:38,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:51:38,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:51:38,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:51:38,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:51:38,236 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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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 -> 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c [2024-11-08 17:51:38,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:51:38,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:51:38,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:51:38,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:51:38,694 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:51:38,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i Unable to find full path for "g++" [2024-11-08 17:51:40,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:51:41,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:51:41,253 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-08 17:51:41,271 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/data/d2ce5fc16/348a5aae6b4247889fd167eb55718594/FLAG02c7ea660 [2024-11-08 17:51:41,297 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/data/d2ce5fc16/348a5aae6b4247889fd167eb55718594 [2024-11-08 17:51:41,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:51:41,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:51:41,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:51:41,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:51:41,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:51:41,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:41,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7557f294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41, skipping insertion in model container [2024-11-08 17:51:41,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:41,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:51:41,650 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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-11-08 17:51:41,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:51:41,820 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:51:41,837 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_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-11-08 17:51:41,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:51:41,968 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:51:41,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41 WrapperNode [2024-11-08 17:51:41,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:51:41,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:51:41,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:51:41,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:51:41,978 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:51:41" (1/1) ... [2024-11-08 17:51:41,999 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:51:41" (1/1) ... [2024-11-08 17:51:42,049 INFO L138 Inliner]: procedures = 30, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 559 [2024-11-08 17:51:42,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:51:42,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:51:42,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:51:42,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:51:42,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:42,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:42,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:42,105 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2024-11-08 17:51:42,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:42,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:42,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:42,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:42,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:42,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:42,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:51:42,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:51:42,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:51:42,197 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:51:42,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (1/1) ... [2024-11-08 17:51:42,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:51:42,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:51:42,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:42,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:42,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:51:42,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 17:51:42,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 17:51:42,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 17:51:42,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 17:51:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-08 17:51:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 17:51:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 17:51:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 17:51:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 17:51:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-08 17:51:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:51:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:51:42,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 17:51:42,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 17:51:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 17:51:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:51:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:51:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 17:51:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 17:51:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 17:51:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-08 17:51:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-08 17:51:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-08 17:51:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-08 17:51:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-08 17:51:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:51:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:51:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:51:42,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:51:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:51:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:51:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 17:51:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 17:51:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 17:51:42,499 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:51:42,502 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:51:43,538 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-08 17:51:43,540 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:51:43,565 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:51:43,565 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:51:43,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:51:43 BoogieIcfgContainer [2024-11-08 17:51:43,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:51:43,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:51:43,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:51:43,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:51:43,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:51:41" (1/3) ... [2024-11-08 17:51:43,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247324d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:51:43, skipping insertion in model container [2024-11-08 17:51:43,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:51:41" (2/3) ... [2024-11-08 17:51:43,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247324d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:51:43, skipping insertion in model container [2024-11-08 17:51:43,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:51:43" (3/3) ... [2024-11-08 17:51:43,580 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2024-11-08 17:51:43,604 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:51:43,604 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:51:43,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:51:43,724 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;@6f458b4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:51:43,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:51:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:51:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:51:43,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:43,753 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:43,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:43,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1137649062, now seen corresponding path program 1 times [2024-11-08 17:51:43,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:51:43,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156385026] [2024-11-08 17:51:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:43,782 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:51:43,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:51:43,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:43,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:44,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:51:44,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:51:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-08 17:51:44,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:51:44,318 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:51:44,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156385026] [2024-11-08 17:51:44,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156385026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:44,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:44,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:51:44,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041173802] [2024-11-08 17:51:44,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:44,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:51:44,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:51:44,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:51:44,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:51:44,379 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:51:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:44,453 INFO L93 Difference]: Finished difference Result 229 states and 363 transitions. [2024-11-08 17:51:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:51:44,456 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-08 17:51:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:44,468 INFO L225 Difference]: With dead ends: 229 [2024-11-08 17:51:44,469 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 17:51:44,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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:51:44,481 INFO L432 NwaCegarLoop]: 168 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, 168 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:51:44,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:51:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 17:51:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-08 17:51:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:51:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 168 transitions. [2024-11-08 17:51:44,560 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 168 transitions. Word has length 149 [2024-11-08 17:51:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:44,561 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 168 transitions. [2024-11-08 17:51:44,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 17:51:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 168 transitions. [2024-11-08 17:51:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:51:44,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:44,566 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:44,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 17:51:44,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:44,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:44,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1110627680, now seen corresponding path program 1 times [2024-11-08 17:51:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:51:44,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489590829] [2024-11-08 17:51:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:44,777 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:51:44,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:51:44,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:44,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:45,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:51:45,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:51:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:45,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:51:45,277 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:51:45,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489590829] [2024-11-08 17:51:45,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489590829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:51:45,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:51:45,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:51:45,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256704154] [2024-11-08 17:51:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:45,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:51:45,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:51:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:51:45,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:51:45,285 INFO L87 Difference]: Start difference. First operand 114 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:45,323 INFO L93 Difference]: Finished difference Result 226 states and 335 transitions. [2024-11-08 17:51:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:51:45,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-08 17:51:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:45,327 INFO L225 Difference]: With dead ends: 226 [2024-11-08 17:51:45,327 INFO L226 Difference]: Without dead ends: 115 [2024-11-08 17:51:45,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:51:45,330 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:45,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:51:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-08 17:51:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-08 17:51:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 17:51:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2024-11-08 17:51:45,355 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 149 [2024-11-08 17:51:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:45,358 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2024-11-08 17:51:45,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2024-11-08 17:51:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:51:45,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:45,362 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:45,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 17:51:45,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:45,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:45,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash -578316062, now seen corresponding path program 1 times [2024-11-08 17:51:45,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:51:45,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062289655] [2024-11-08 17:51:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:45,568 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:51:45,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:51:45,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:45,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 17:51:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:45,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 17:51:45,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:51:46,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-08 17:51:48,275 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:51:48,418 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:51:48,485 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:51:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 35 proven. 384 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-08 17:51:48,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:51:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:51:49,161 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:51:49,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062289655] [2024-11-08 17:51:49,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062289655] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:51:49,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:51:49,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20] total 26 [2024-11-08 17:51:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103510545] [2024-11-08 17:51:49,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:51:49,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:51:49,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:51:49,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:51:49,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:51:49,165 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:51:49,998 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2024-11-08 17:51:49,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:51:49,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-08 17:51:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:51:50,002 INFO L225 Difference]: With dead ends: 312 [2024-11-08 17:51:50,002 INFO L226 Difference]: Without dead ends: 200 [2024-11-08 17:51:50,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2024-11-08 17:51:50,004 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 117 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:51:50,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1266 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:51:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-08 17:51:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2024-11-08 17:51:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 166 states have (on average 1.4096385542168675) internal successors, (234), 167 states have internal predecessors, (234), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 17:51:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 290 transitions. [2024-11-08 17:51:50,029 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 290 transitions. Word has length 149 [2024-11-08 17:51:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:51:50,030 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 290 transitions. [2024-11-08 17:51:50,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:51:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 290 transitions. [2024-11-08 17:51:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:51:50,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:51:50,034 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:50,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 17:51:50,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:50,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:51:50,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:51:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1001017888, now seen corresponding path program 1 times [2024-11-08 17:51:50,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:51:50,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961151613] [2024-11-08 17:51:50,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:50,239 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:51:50,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:51:50,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:50,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:51:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:50,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 17:51:50,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:51:50,966 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:51:55,207 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:51:55,359 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-08 17:51:55,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2024-11-08 17:51:55,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:51:55,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2024-11-08 17:51:55,723 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:51:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 35 proven. 384 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-08 17:51:55,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:51:56,330 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 87 treesize of output 83 [2024-11-08 17:51:56,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:51:56,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961151613] [2024-11-08 17:51:56,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961151613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:51:56,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638469717] [2024-11-08 17:51:56,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:51:56,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:51:56,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:51:56,927 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:51:56,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:51:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:51:57,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 17:51:57,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:51:57,546 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:52:02,015 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:52:02,228 INFO L349 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2024-11-08 17:52:02,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2024-11-08 17:52:02,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:52:02,574 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 35 treesize of output 21 [2024-11-08 17:52:02,604 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:52:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 411 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 17:52:02,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:52:02,957 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 87 treesize of output 83 [2024-11-08 17:52:03,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638469717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:03,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:52:03,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 35 [2024-11-08 17:52:03,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14244892] [2024-11-08 17:52:03,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:52:03,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-08 17:52:03,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:52:03,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 17:52:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1848, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 17:52:03,314 INFO L87 Difference]: Start difference. First operand 197 states and 290 transitions. Second operand has 36 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 states have internal predecessors, (119), 7 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (38), 5 states have call predecessors, (38), 7 states have call successors, (38) [2024-11-08 17:52:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:15,673 INFO L93 Difference]: Finished difference Result 895 states and 1310 transitions. [2024-11-08 17:52:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-08 17:52:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 states have internal predecessors, (119), 7 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (38), 5 states have call predecessors, (38), 7 states have call successors, (38) Word has length 149 [2024-11-08 17:52:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:15,682 INFO L225 Difference]: With dead ends: 895 [2024-11-08 17:52:15,685 INFO L226 Difference]: Without dead ends: 701 [2024-11-08 17:52:15,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 308 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1149, Invalid=5657, Unknown=0, NotChecked=0, Total=6806 [2024-11-08 17:52:15,693 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 3276 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 3026 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3276 SdHoareTripleChecker+Valid, 3353 SdHoareTripleChecker+Invalid, 3568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 3026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:15,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3276 Valid, 3353 Invalid, 3568 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [542 Valid, 3026 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-08 17:52:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-08 17:52:15,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 429. [2024-11-08 17:52:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 366 states have (on average 1.4344262295081966) internal successors, (525), 368 states have internal predecessors, (525), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 17:52:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 637 transitions. [2024-11-08 17:52:15,818 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 637 transitions. Word has length 149 [2024-11-08 17:52:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:15,823 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 637 transitions. [2024-11-08 17:52:15,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 states have internal predecessors, (119), 7 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (38), 5 states have call predecessors, (38), 7 states have call successors, (38) [2024-11-08 17:52:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 637 transitions. [2024-11-08 17:52:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 17:52:15,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:15,834 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:15,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 17:52:16,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:52:16,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:52:16,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:52:16,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:16,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1722610463, now seen corresponding path program 1 times [2024-11-08 17:52:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:52:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323516401] [2024-11-08 17:52:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:16,237 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:52:16,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:52:16,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:52:16,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:52:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:16,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 17:52:16,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:16,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-08 17:52:18,270 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:52:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 35 proven. 384 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-08 17:52:18,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:52:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:52:18,610 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:52:18,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323516401] [2024-11-08 17:52:18,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323516401] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:18,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:52:18,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-08 17:52:18,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128200718] [2024-11-08 17:52:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:18,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:52:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:52:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:52:18,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:52:18,614 INFO L87 Difference]: Start difference. First operand 429 states and 637 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:52:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:18,803 INFO L93 Difference]: Finished difference Result 896 states and 1333 transitions. [2024-11-08 17:52:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:52:18,804 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-08 17:52:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:18,808 INFO L225 Difference]: With dead ends: 896 [2024-11-08 17:52:18,809 INFO L226 Difference]: Without dead ends: 470 [2024-11-08 17:52:18,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:52:18,811 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 142 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:18,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 510 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:52:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-08 17:52:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 436. [2024-11-08 17:52:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 373 states have (on average 1.4289544235924934) internal successors, (533), 375 states have internal predecessors, (533), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 17:52:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 645 transitions. [2024-11-08 17:52:18,883 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 645 transitions. Word has length 150 [2024-11-08 17:52:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:18,884 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 645 transitions. [2024-11-08 17:52:18,884 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:52:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 645 transitions. [2024-11-08 17:52:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 17:52:18,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:18,887 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:18,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 17:52:19,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:52:19,092 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:52:19,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -218302155, now seen corresponding path program 1 times [2024-11-08 17:52:19,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:52:19,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401209075] [2024-11-08 17:52:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:19,094 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:52:19,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:52:19,097 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:52:19,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:52:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:19,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 17:52:19,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:19,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-08 17:52:20,171 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 23 treesize of output 15 [2024-11-08 17:52:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-08 17:52:20,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:52:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:52:20,422 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:52:20,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401209075] [2024-11-08 17:52:20,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401209075] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:20,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:52:20,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-08 17:52:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072019045] [2024-11-08 17:52:20,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:52:20,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:52:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:52:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:52:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:52:20,425 INFO L87 Difference]: Start difference. First operand 436 states and 645 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:52:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:52:20,715 INFO L93 Difference]: Finished difference Result 918 states and 1357 transitions. [2024-11-08 17:52:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:52:20,717 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-08 17:52:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:52:20,721 INFO L225 Difference]: With dead ends: 918 [2024-11-08 17:52:20,721 INFO L226 Difference]: Without dead ends: 485 [2024-11-08 17:52:20,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:52:20,723 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 81 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:52:20,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 790 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:52:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-08 17:52:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 431. [2024-11-08 17:52:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 368 states have (on average 1.421195652173913) internal successors, (523), 370 states have internal predecessors, (523), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 17:52:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 635 transitions. [2024-11-08 17:52:20,771 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 635 transitions. Word has length 150 [2024-11-08 17:52:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:52:20,772 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 635 transitions. [2024-11-08 17:52:20,772 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:52:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 635 transitions. [2024-11-08 17:52:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:52:20,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:52:20,776 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:20,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-08 17:52:20,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:52:20,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:52:20,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:52:20,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1972411132, now seen corresponding path program 1 times [2024-11-08 17:52:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:52:20,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064726830] [2024-11-08 17:52:20,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:20,979 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:52:20,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:52:20,982 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:52:20,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:52:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:21,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-08 17:52:21,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:29,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-11-08 17:52:31,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 32 [2024-11-08 17:52:33,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2024-11-08 17:52:35,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2024-11-08 17:52:41,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 110 [2024-11-08 17:52:43,189 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 48 treesize of output 36 [2024-11-08 17:52:43,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:52:43,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 132 treesize of output 76 [2024-11-08 17:52:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 91 proven. 437 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-08 17:52:44,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:52:49,656 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:52:49,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064726830] [2024-11-08 17:52:49,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064726830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:52:49,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276056150] [2024-11-08 17:52:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:52:49,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:52:49,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:52:49,658 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:52:49,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 17:52:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:52:49,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 17:52:49,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:52:50,288 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:52:55,466 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:52:56,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-08 17:53:00,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2024-11-08 17:53:01,439 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 48 treesize of output 36 [2024-11-08 17:53:01,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:01,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 38 [2024-11-08 17:53:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 29 proven. 445 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-08 17:53:02,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:53:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276056150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:53:16,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:53:16,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 24] total 64 [2024-11-08 17:53:16,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496339461] [2024-11-08 17:53:16,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:53:16,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-08 17:53:16,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:53:16,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-08 17:53:16,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=6239, Unknown=0, NotChecked=0, Total=6972 [2024-11-08 17:53:16,305 INFO L87 Difference]: Start difference. First operand 431 states and 635 transitions. Second operand has 65 states, 56 states have (on average 2.6964285714285716) internal successors, (151), 55 states have internal predecessors, (151), 17 states have call successors, (38), 12 states have call predecessors, (38), 17 states have return successors, (38), 13 states have call predecessors, (38), 17 states have call successors, (38) [2024-11-08 17:54:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:54:05,943 INFO L93 Difference]: Finished difference Result 1223 states and 1781 transitions. [2024-11-08 17:54:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-08 17:54:05,944 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 56 states have (on average 2.6964285714285716) internal successors, (151), 55 states have internal predecessors, (151), 17 states have call successors, (38), 12 states have call predecessors, (38), 17 states have return successors, (38), 13 states have call predecessors, (38), 17 states have call successors, (38) Word has length 151 [2024-11-08 17:54:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:54:05,949 INFO L225 Difference]: With dead ends: 1223 [2024-11-08 17:54:05,949 INFO L226 Difference]: Without dead ends: 795 [2024-11-08 17:54:05,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5945 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=2995, Invalid=17311, Unknown=0, NotChecked=0, Total=20306 [2024-11-08 17:54:05,956 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 2754 mSDsluCounter, 3992 mSDsCounter, 0 mSdLazyCounter, 3853 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2755 SdHoareTripleChecker+Valid, 4141 SdHoareTripleChecker+Invalid, 4298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 3853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:54:05,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2755 Valid, 4141 Invalid, 4298 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [445 Valid, 3853 Invalid, 0 Unknown, 0 Unchecked, 16.5s Time] [2024-11-08 17:54:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-11-08 17:54:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 483. [2024-11-08 17:54:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 416 states have (on average 1.4230769230769231) internal successors, (592), 418 states have internal predecessors, (592), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 17:54:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 704 transitions. [2024-11-08 17:54:06,069 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 704 transitions. Word has length 151 [2024-11-08 17:54:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:54:06,071 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 704 transitions. [2024-11-08 17:54:06,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 56 states have (on average 2.6964285714285716) internal successors, (151), 55 states have internal predecessors, (151), 17 states have call successors, (38), 12 states have call predecessors, (38), 17 states have return successors, (38), 13 states have call predecessors, (38), 17 states have call successors, (38) [2024-11-08 17:54:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 704 transitions. [2024-11-08 17:54:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:54:06,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:54:06,078 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:06,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 17:54:06,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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)] Ended with exit code 0 [2024-11-08 17:54:06,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:54:06,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:54:06,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:54:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1385605118, now seen corresponding path program 1 times [2024-11-08 17:54:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:54:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88596587] [2024-11-08 17:54:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:54:06,480 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:54:06,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:54:06,483 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:54:06,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:54:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:06,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 17:54:06,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:54:09,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 17:54:10,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-08 17:54:11,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-08 17:54:11,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2024-11-08 17:54:12,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:54:12,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 30 [2024-11-08 17:54:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 227 proven. 139 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-08 17:54:12,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:54:12,984 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:54:12,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88596587] [2024-11-08 17:54:12,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88596587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:54:12,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414185798] [2024-11-08 17:54:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:54:12,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:54:12,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:54:12,988 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:54:12,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 17:54:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:13,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-08 17:54:13,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:54:13,505 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:54:18,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 17:54:19,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-08 17:54:22,668 INFO L349 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2024-11-08 17:54:22,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 70 [2024-11-08 17:54:24,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:54:24,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 162 [2024-11-08 17:54:25,079 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 160 treesize of output 140 [2024-11-08 17:54:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 469 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-08 17:54:26,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:54:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414185798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:54:31,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:54:31,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 31] total 46 [2024-11-08 17:54:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999033412] [2024-11-08 17:54:31,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:54:31,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 17:54:31,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:54:31,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 17:54:31,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=4284, Unknown=0, NotChecked=0, Total=4556 [2024-11-08 17:54:31,529 INFO L87 Difference]: Start difference. First operand 483 states and 704 transitions. Second operand has 47 states, 42 states have (on average 3.4761904761904763) internal successors, (146), 42 states have internal predecessors, (146), 13 states have call successors, (38), 10 states have call predecessors, (38), 14 states have return successors, (38), 10 states have call predecessors, (38), 13 states have call successors, (38) [2024-11-08 17:55:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:15,439 INFO L93 Difference]: Finished difference Result 1490 states and 2145 transitions. [2024-11-08 17:55:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-11-08 17:55:15,440 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 3.4761904761904763) internal successors, (146), 42 states have internal predecessors, (146), 13 states have call successors, (38), 10 states have call predecessors, (38), 14 states have return successors, (38), 10 states have call predecessors, (38), 13 states have call successors, (38) Word has length 151 [2024-11-08 17:55:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:15,444 INFO L225 Difference]: With dead ends: 1490 [2024-11-08 17:55:15,444 INFO L226 Difference]: Without dead ends: 1010 [2024-11-08 17:55:15,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5175 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=2489, Invalid=17533, Unknown=0, NotChecked=0, Total=20022 [2024-11-08 17:55:15,451 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 3106 mSDsluCounter, 5005 mSDsCounter, 0 mSdLazyCounter, 4247 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3123 SdHoareTripleChecker+Valid, 5200 SdHoareTripleChecker+Invalid, 4965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 4247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:15,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3123 Valid, 5200 Invalid, 4965 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [718 Valid, 4247 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2024-11-08 17:55:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-11-08 17:55:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 672. [2024-11-08 17:55:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 579 states have (on average 1.4145077720207253) internal successors, (819), 583 states have internal predecessors, (819), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:55:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 975 transitions. [2024-11-08 17:55:15,567 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 975 transitions. Word has length 151 [2024-11-08 17:55:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:15,567 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 975 transitions. [2024-11-08 17:55:15,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 3.4761904761904763) internal successors, (146), 42 states have internal predecessors, (146), 13 states have call successors, (38), 10 states have call predecessors, (38), 14 states have return successors, (38), 10 states have call predecessors, (38), 13 states have call successors, (38) [2024-11-08 17:55:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 975 transitions. [2024-11-08 17:55:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:55:15,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:15,571 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:15,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:55:15,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 17:55:15,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:55:15,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:15,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:15,972 INFO L85 PathProgramCache]: Analyzing trace with hash 962903292, now seen corresponding path program 1 times [2024-11-08 17:55:15,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:55:15,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244685051] [2024-11-08 17:55:15,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:15,973 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:55:15,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:55:15,974 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:55:15,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:55:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:16,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 17:55:16,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:55:20,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 17:55:21,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 17:55:22,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-08 17:55:24,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2024-11-08 17:55:24,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2024-11-08 17:55:25,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:25,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 39 [2024-11-08 17:55:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 227 proven. 139 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-08 17:55:25,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:55:26,465 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:55:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244685051] [2024-11-08 17:55:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244685051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:55:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117099279] [2024-11-08 17:55:26,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:26,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:55:26,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:55:26,467 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:55:26,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 17:55:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:26,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 17:55:26,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:55:31,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 14 treesize of output 10 [2024-11-08 17:55:33,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:55:33,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-08 17:55:35,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:55:35,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:55:35,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2024-11-08 17:55:35,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:55:35,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:55:35,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:55:35,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2024-11-08 17:55:36,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:36,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 31 [2024-11-08 17:55:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 123 proven. 136 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2024-11-08 17:55:36,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:55:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117099279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:55:36,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:55:36,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2024-11-08 17:55:36,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52972576] [2024-11-08 17:55:36,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:55:36,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 17:55:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:55:36,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 17:55:36,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2024-11-08 17:55:36,671 INFO L87 Difference]: Start difference. First operand 672 states and 975 transitions. Second operand has 31 states, 28 states have (on average 4.607142857142857) internal successors, (129), 27 states have internal predecessors, (129), 10 states have call successors, (38), 7 states have call predecessors, (38), 10 states have return successors, (38), 10 states have call predecessors, (38), 10 states have call successors, (38) [2024-11-08 17:55:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:49,901 INFO L93 Difference]: Finished difference Result 1614 states and 2319 transitions. [2024-11-08 17:55:49,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 17:55:49,902 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 4.607142857142857) internal successors, (129), 27 states have internal predecessors, (129), 10 states have call successors, (38), 7 states have call predecessors, (38), 10 states have return successors, (38), 10 states have call predecessors, (38), 10 states have call successors, (38) Word has length 151 [2024-11-08 17:55:49,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:49,906 INFO L225 Difference]: With dead ends: 1614 [2024-11-08 17:55:49,906 INFO L226 Difference]: Without dead ends: 945 [2024-11-08 17:55:49,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=837, Invalid=3195, Unknown=0, NotChecked=0, Total=4032 [2024-11-08 17:55:49,909 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1538 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:49,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 2249 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-08 17:55:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-08 17:55:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 672. [2024-11-08 17:55:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 579 states have (on average 1.4093264248704662) internal successors, (816), 583 states have internal predecessors, (816), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:55:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 972 transitions. [2024-11-08 17:55:50,106 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 972 transitions. Word has length 151 [2024-11-08 17:55:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:50,107 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 972 transitions. [2024-11-08 17:55:50,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 4.607142857142857) internal successors, (129), 27 states have internal predecessors, (129), 10 states have call successors, (38), 7 states have call predecessors, (38), 10 states have return successors, (38), 10 states have call predecessors, (38), 10 states have call successors, (38) [2024-11-08 17:55:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 972 transitions. [2024-11-08 17:55:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:55:50,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:50,110 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:50,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 17:55:50,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:55:50,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:55:50,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:50,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash -822515289, now seen corresponding path program 1 times [2024-11-08 17:55:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:55:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839993870] [2024-11-08 17:55:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:50,512 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:55:50,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:55:50,513 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:55:50,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:55:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:50,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:55:50,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:55:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:55:50,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:55:50,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:55:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839993870] [2024-11-08 17:55:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839993870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:55:50,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:55:50,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:55:50,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410019650] [2024-11-08 17:55:50,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:55:50,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:55:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:55:50,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:55:50,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:55:50,834 INFO L87 Difference]: Start difference. First operand 672 states and 972 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:55:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:51,081 INFO L93 Difference]: Finished difference Result 1359 states and 1965 transitions. [2024-11-08 17:55:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:55:51,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-08 17:55:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:51,086 INFO L225 Difference]: With dead ends: 1359 [2024-11-08 17:55:51,086 INFO L226 Difference]: Without dead ends: 690 [2024-11-08 17:55:51,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 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:55:51,088 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:51,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:55:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-08 17:55:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2024-11-08 17:55:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 597 states have (on average 1.3969849246231156) internal successors, (834), 601 states have internal predecessors, (834), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:55:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 990 transitions. [2024-11-08 17:55:51,288 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 990 transitions. Word has length 151 [2024-11-08 17:55:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:51,288 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 990 transitions. [2024-11-08 17:55:51,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:55:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 990 transitions. [2024-11-08 17:55:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:55:51,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:51,291 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:51,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:55:51,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:55:51,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:51,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1686126788, now seen corresponding path program 1 times [2024-11-08 17:55:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:55:51,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627533502] [2024-11-08 17:55:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:51,494 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:55:51,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:55:51,497 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:55:51,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:55:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:51,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-08 17:55:51,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:55:52,166 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:55:58,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 17:55:59,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-08 17:56:01,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2024-11-08 17:56:02,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-08 17:56:02,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:02,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 43 [2024-11-08 17:56:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 52 proven. 434 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-08 17:56:02,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:56:06,221 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:56:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627533502] [2024-11-08 17:56:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627533502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:56:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306578537] [2024-11-08 17:56:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:06,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:56:06,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:56:06,223 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:56:06,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 17:56:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:06,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 17:56:06,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:56:06,683 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:56:12,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 17:56:14,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 17:56:17,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2024-11-08 17:56:18,383 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 50 treesize of output 38 [2024-11-08 17:56:18,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:18,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 40 [2024-11-08 17:56:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 445 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-08 17:56:19,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:56:23,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306578537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:56:23,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:56:23,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 49 [2024-11-08 17:56:24,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344784469] [2024-11-08 17:56:24,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:56:24,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-08 17:56:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:56:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-08 17:56:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=3724, Unknown=0, NotChecked=0, Total=4160 [2024-11-08 17:56:24,003 INFO L87 Difference]: Start difference. First operand 690 states and 990 transitions. Second operand has 50 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 13 states have call successors, (29), 9 states have call predecessors, (29), 13 states have return successors, (29), 9 states have call predecessors, (29), 13 states have call successors, (29) [2024-11-08 17:56:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:49,484 INFO L93 Difference]: Finished difference Result 1604 states and 2295 transitions. [2024-11-08 17:56:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-08 17:56:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 13 states have call successors, (29), 9 states have call predecessors, (29), 13 states have return successors, (29), 9 states have call predecessors, (29), 13 states have call successors, (29) Word has length 151 [2024-11-08 17:56:49,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:49,490 INFO L225 Difference]: With dead ends: 1604 [2024-11-08 17:56:49,490 INFO L226 Difference]: Without dead ends: 917 [2024-11-08 17:56:49,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3148 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=1552, Invalid=9368, Unknown=0, NotChecked=0, Total=10920 [2024-11-08 17:56:49,494 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 2193 mSDsluCounter, 3872 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 4007 SdHoareTripleChecker+Invalid, 3615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:49,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 4007 Invalid, 3615 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [576 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2024-11-08 17:56:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-08 17:56:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 691. [2024-11-08 17:56:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 598 states have (on average 1.3963210702341138) internal successors, (835), 602 states have internal predecessors, (835), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:56:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 991 transitions. [2024-11-08 17:56:49,704 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 991 transitions. Word has length 151 [2024-11-08 17:56:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:49,704 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 991 transitions. [2024-11-08 17:56:49,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 13 states have call successors, (29), 9 states have call predecessors, (29), 13 states have return successors, (29), 9 states have call predecessors, (29), 13 states have call successors, (29) [2024-11-08 17:56:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 991 transitions. [2024-11-08 17:56:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:56:49,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:49,707 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:49,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-08 17:56:49,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:56:50,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:56:50,108 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:50,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:50,108 INFO L85 PathProgramCache]: Analyzing trace with hash 119311546, now seen corresponding path program 1 times [2024-11-08 17:56:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:56:50,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977289927] [2024-11-08 17:56:50,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:50,109 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:56:50,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:56:50,110 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:56:50,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:56:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:50,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-08 17:56:50,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:56:50,895 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:56:58,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 17:57:00,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 17:57:03,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2024-11-08 17:57:03,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2024-11-08 17:57:04,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-08 17:57:04,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:04,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 47 [2024-11-08 17:57:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 72 proven. 434 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-08 17:57:05,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:57:10,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:57:10,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977289927] [2024-11-08 17:57:10,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977289927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:57:10,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094004393] [2024-11-08 17:57:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:10,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:57:10,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:57:10,950 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:57:10,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 17:57:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 17:57:11,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:57:11,553 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:57:18,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 17:57:21,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 17:57:25,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2024-11-08 17:57:25,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 70 [2024-11-08 17:57:26,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-08 17:57:27,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:27,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 47 [2024-11-08 17:57:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 445 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-08 17:57:28,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:57:29,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094004393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:57:29,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:57:29,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 52 [2024-11-08 17:57:29,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251380397] [2024-11-08 17:57:29,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:57:29,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-08 17:57:29,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:57:29,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-08 17:57:30,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=3708, Unknown=0, NotChecked=0, Total=4160 [2024-11-08 17:57:30,000 INFO L87 Difference]: Start difference. First operand 691 states and 991 transitions. Second operand has 53 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 14 states have call successors, (29), 10 states have call predecessors, (29), 14 states have return successors, (29), 10 states have call predecessors, (29), 14 states have call successors, (29) [2024-11-08 17:58:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:01,877 INFO L93 Difference]: Finished difference Result 1364 states and 1947 transitions. [2024-11-08 17:58:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-08 17:58:01,878 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 14 states have call successors, (29), 10 states have call predecessors, (29), 14 states have return successors, (29), 10 states have call predecessors, (29), 14 states have call successors, (29) Word has length 151 [2024-11-08 17:58:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:01,883 INFO L225 Difference]: With dead ends: 1364 [2024-11-08 17:58:01,883 INFO L226 Difference]: Without dead ends: 975 [2024-11-08 17:58:01,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3223 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=1644, Invalid=9912, Unknown=0, NotChecked=0, Total=11556 [2024-11-08 17:58:01,887 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 3434 mSDsluCounter, 4922 mSDsCounter, 0 mSdLazyCounter, 3791 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3434 SdHoareTripleChecker+Valid, 5123 SdHoareTripleChecker+Invalid, 4426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 3791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:01,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3434 Valid, 5123 Invalid, 4426 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [635 Valid, 3791 Invalid, 0 Unknown, 0 Unchecked, 16.9s Time] [2024-11-08 17:58:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-08 17:58:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 706. [2024-11-08 17:58:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 613 states have (on average 1.3996737357259381) internal successors, (858), 617 states have internal predecessors, (858), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:58:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1014 transitions. [2024-11-08 17:58:02,114 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1014 transitions. Word has length 151 [2024-11-08 17:58:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:02,115 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1014 transitions. [2024-11-08 17:58:02,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 14 states have call successors, (29), 10 states have call predecessors, (29), 14 states have return successors, (29), 10 states have call predecessors, (29), 14 states have call successors, (29) [2024-11-08 17:58:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1014 transitions. [2024-11-08 17:58:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:58:02,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:02,117 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:02,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:58:02,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-08 17:58:02,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:58:02,518 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:02,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash -399328130, now seen corresponding path program 1 times [2024-11-08 17:58:02,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:58:02,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615294334] [2024-11-08 17:58:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:02,520 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:58:02,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:58:02,524 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:58:02,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:58:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:02,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:58:02,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:02,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:58:02,970 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 33 treesize of output 29 [2024-11-08 17:58:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 17:58:03,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:58:03,012 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:58:03,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615294334] [2024-11-08 17:58:03,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615294334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:03,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:03,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:58:03,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118484696] [2024-11-08 17:58:03,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:03,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:58:03,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:58:03,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:58:03,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:58:03,014 INFO L87 Difference]: Start difference. First operand 706 states and 1014 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:58:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:03,554 INFO L93 Difference]: Finished difference Result 1409 states and 2025 transitions. [2024-11-08 17:58:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:58:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-08 17:58:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:03,558 INFO L225 Difference]: With dead ends: 1409 [2024-11-08 17:58:03,559 INFO L226 Difference]: Without dead ends: 706 [2024-11-08 17:58:03,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 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:58:03,561 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 4 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:03,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 575 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:58:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-08 17:58:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2024-11-08 17:58:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 613 states have (on average 1.3964110929853182) internal successors, (856), 617 states have internal predecessors, (856), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 17:58:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1012 transitions. [2024-11-08 17:58:03,771 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1012 transitions. Word has length 151 [2024-11-08 17:58:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:03,772 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1012 transitions. [2024-11-08 17:58:03,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 17:58:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1012 transitions. [2024-11-08 17:58:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 17:58:03,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:03,776 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:03,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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)] Ended with exit code 0 [2024-11-08 17:58:03,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:58:03,980 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:03,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:03,982 INFO L85 PathProgramCache]: Analyzing trace with hash -258779520, now seen corresponding path program 1 times [2024-11-08 17:58:03,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:58:03,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863866590] [2024-11-08 17:58:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:03,983 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:58:03,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:58:03,987 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:58:03,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/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:58:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:04,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-08 17:58:04,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:11,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-08 17:58:13,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-08 17:58:15,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2024-11-08 17:58:16,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2024-11-08 17:58:21,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 95 [2024-11-08 17:58:23,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:58:23,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 60 [2024-11-08 17:58:23,534 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:58:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 79 proven. 446 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-08 17:58:24,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:58:53,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:58:53,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863866590] [2024-11-08 17:58:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863866590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:58:53,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964852074] [2024-11-08 17:58:53,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:53,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:58:53,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:58:53,541 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:58:53,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ee6ac4-fcd0-46d7-9240-0f57c27593d1/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-08 17:58:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:53,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 17:58:53,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:56,487 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:59:36,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 17:59:49,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-08 18:00:05,111 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 35 treesize of output 23 [2024-11-08 18:00:12,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2024-11-08 18:00:16,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:00:16,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36 [2024-11-08 18:00:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 445 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-08 18:00:18,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:00:34,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964852074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:00:34,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:00:34,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 24] total 63 [2024-11-08 18:00:34,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272613927] [2024-11-08 18:00:34,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:00:34,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-08 18:00:34,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:00:34,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-08 18:00:34,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=7247, Unknown=5, NotChecked=0, Total=7656 [2024-11-08 18:00:34,094 INFO L87 Difference]: Start difference. First operand 706 states and 1012 transitions. Second operand has 64 states, 56 states have (on average 2.767857142857143) internal successors, (155), 55 states have internal predecessors, (155), 17 states have call successors, (38), 13 states have call predecessors, (38), 17 states have return successors, (38), 13 states have call predecessors, (38), 17 states have call successors, (38)