./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:43:36,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:43:37,037 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:43:37,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:43:37,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:43:37,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:43:37,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:43:37,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:43:37,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:43:37,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:43:37,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:43:37,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:43:37,097 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:43:37,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:43:37,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:43:37,100 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:43:37,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:43:37,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:43:37,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:43:37,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:43:37,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:43:37,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:43:37,104 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:43:37,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:43:37,105 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:43:37,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:43:37,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:43:37,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:43:37,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:43:37,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:43:37,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:43:37,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:43:37,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:43:37,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:43:37,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:43:37,111 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:43:37,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:43:37,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:43:37,112 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:43:37,112 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_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/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_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 [2023-11-06 22:43:37,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:43:37,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:43:37,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:43:37,479 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:43:37,479 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:43:37,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2023-11-06 22:43:40,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:43:41,050 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:43:41,050 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2023-11-06 22:43:41,066 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/data/e2b90d1f6/0d2c7ca231fb44bda96c3076f7a77524/FLAG602fada18 [2023-11-06 22:43:41,085 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/data/e2b90d1f6/0d2c7ca231fb44bda96c3076f7a77524 [2023-11-06 22:43:41,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:43:41,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:43:41,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:43:41,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:43:41,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:43:41,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de1d82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41, skipping insertion in model container [2023-11-06 22:43:41,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,150 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:43:41,344 WARN L240 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_55418f8d-e91e-43f9-af57-47dfeb57d716/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i[916,929] [2023-11-06 22:43:41,438 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:43:41,453 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:43:41,480 WARN L240 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_55418f8d-e91e-43f9-af57-47dfeb57d716/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i[916,929] [2023-11-06 22:43:41,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:43:41,555 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:43:41,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41 WrapperNode [2023-11-06 22:43:41,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:43:41,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:43:41,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:43:41,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:43:41,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,649 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2023-11-06 22:43:41,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:43:41,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:43:41,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:43:41,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:43:41,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:43:41,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:43:41,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:43:41,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:43:41,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (1/1) ... [2023-11-06 22:43:41,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:43:41,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:43:41,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:43:41,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:43:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:43:41,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:43:41,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:43:41,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:43:41,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:43:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:43:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:43:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:43:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:43:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:43:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:43:42,029 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:43:42,031 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:43:42,679 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:43:42,688 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:43:42,688 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:43:42,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:42 BoogieIcfgContainer [2023-11-06 22:43:42,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:43:42,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:43:42,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:43:42,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:43:42,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:43:41" (1/3) ... [2023-11-06 22:43:42,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f200c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:43:42, skipping insertion in model container [2023-11-06 22:43:42,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:41" (2/3) ... [2023-11-06 22:43:42,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f200c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:43:42, skipping insertion in model container [2023-11-06 22:43:42,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:42" (3/3) ... [2023-11-06 22:43:42,705 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-88.i [2023-11-06 22:43:42,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:43:42,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:43:42,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:43:42,789 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@233b4bf0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:43:42,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:43:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:43:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-06 22:43:42,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:42,821 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:42,821 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:42,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash -367862550, now seen corresponding path program 1 times [2023-11-06 22:43:42,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:42,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925233530] [2023-11-06 22:43:42,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:42,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:43,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:43,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925233530] [2023-11-06 22:43:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925233530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:43,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:43,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:43:43,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884106636] [2023-11-06 22:43:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:43,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:43:43,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:43,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:43:43,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:43:43,449 INFO L87 Difference]: Start difference. First operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:43:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:43,486 INFO L93 Difference]: Finished difference Result 227 states and 357 transitions. [2023-11-06 22:43:43,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:43:43,489 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-11-06 22:43:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:43,498 INFO L225 Difference]: With dead ends: 227 [2023-11-06 22:43:43,498 INFO L226 Difference]: Without dead ends: 113 [2023-11-06 22:43:43,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:43:43,506 INFO L413 NwaCegarLoop]: 166 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, 166 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 [2023-11-06 22:43:43,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:43:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-06 22:43:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-06 22:43:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:43:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2023-11-06 22:43:43,561 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 143 [2023-11-06 22:43:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:43,562 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2023-11-06 22:43:43,562 INFO L496 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:43:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2023-11-06 22:43:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-06 22:43:43,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:43,567 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:43,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:43:43,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:43,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1497235204, now seen corresponding path program 1 times [2023-11-06 22:43:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:43,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43967542] [2023-11-06 22:43:43,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:43,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:44,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:44,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43967542] [2023-11-06 22:43:44,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43967542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:44,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:44,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:43:44,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127530516] [2023-11-06 22:43:44,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:44,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:43:44,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:44,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:43:44,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:43:44,171 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:44,270 INFO L93 Difference]: Finished difference Result 235 states and 346 transitions. [2023-11-06 22:43:44,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:43:44,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2023-11-06 22:43:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:44,277 INFO L225 Difference]: With dead ends: 235 [2023-11-06 22:43:44,277 INFO L226 Difference]: Without dead ends: 125 [2023-11-06 22:43:44,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:44,280 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 21 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:44,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 485 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:43:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-06 22:43:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2023-11-06 22:43:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:43:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2023-11-06 22:43:44,312 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2023-11-06 22:43:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:44,314 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2023-11-06 22:43:44,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2023-11-06 22:43:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-06 22:43:44,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:44,328 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:44,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:43:44,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:44,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:44,329 INFO L85 PathProgramCache]: Analyzing trace with hash -817176834, now seen corresponding path program 1 times [2023-11-06 22:43:44,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:44,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375305925] [2023-11-06 22:43:44,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:44,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375305925] [2023-11-06 22:43:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375305925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:44,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:44,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:43:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734903007] [2023-11-06 22:43:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:44,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:43:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:44,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:43:44,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:43:44,729 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:44,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:44,789 INFO L93 Difference]: Finished difference Result 231 states and 338 transitions. [2023-11-06 22:43:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:43:44,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2023-11-06 22:43:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:44,796 INFO L225 Difference]: With dead ends: 231 [2023-11-06 22:43:44,797 INFO L226 Difference]: Without dead ends: 119 [2023-11-06 22:43:44,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:44,803 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 3 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 482 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 [2023-11-06 22:43:44,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 482 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:43:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-06 22:43:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2023-11-06 22:43:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:43:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2023-11-06 22:43:44,826 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2023-11-06 22:43:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:44,828 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2023-11-06 22:43:44,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2023-11-06 22:43:44,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-06 22:43:44,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:44,835 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:44,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:43:44,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:44,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash -815329792, now seen corresponding path program 1 times [2023-11-06 22:43:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:44,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359907481] [2023-11-06 22:43:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:46,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359907481] [2023-11-06 22:43:46,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359907481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:46,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:46,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:43:46,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449460411] [2023-11-06 22:43:46,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:46,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:43:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:43:46,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:43:46,390 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:47,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:47,014 INFO L93 Difference]: Finished difference Result 318 states and 462 transitions. [2023-11-06 22:43:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:43:47,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2023-11-06 22:43:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:47,019 INFO L225 Difference]: With dead ends: 318 [2023-11-06 22:43:47,019 INFO L226 Difference]: Without dead ends: 204 [2023-11-06 22:43:47,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:43:47,032 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 586 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:47,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 363 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:43:47,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-11-06 22:43:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 132. [2023-11-06 22:43:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.407079646017699) internal successors, (159), 113 states have internal predecessors, (159), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:43:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2023-11-06 22:43:47,065 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 143 [2023-11-06 22:43:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:47,067 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2023-11-06 22:43:47,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2023-11-06 22:43:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-06 22:43:47,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:47,070 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:47,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:43:47,071 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:47,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1164857074, now seen corresponding path program 1 times [2023-11-06 22:43:47,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:47,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387314008] [2023-11-06 22:43:47,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:47,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:47,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:47,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387314008] [2023-11-06 22:43:47,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387314008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:47,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:47,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:43:47,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127189871] [2023-11-06 22:43:47,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:47,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:47,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:47,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:47,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:47,477 INFO L87 Difference]: Start difference. First operand 132 states and 193 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:47,548 INFO L93 Difference]: Finished difference Result 288 states and 421 transitions. [2023-11-06 22:43:47,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:43:47,549 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2023-11-06 22:43:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:47,551 INFO L225 Difference]: With dead ends: 288 [2023-11-06 22:43:47,552 INFO L226 Difference]: Without dead ends: 159 [2023-11-06 22:43:47,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:47,575 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 89 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:47,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 659 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:43:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-06 22:43:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2023-11-06 22:43:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.396551724137931) internal successors, (162), 116 states have internal predecessors, (162), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:43:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 196 transitions. [2023-11-06 22:43:47,598 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 196 transitions. Word has length 145 [2023-11-06 22:43:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:47,599 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 196 transitions. [2023-11-06 22:43:47,599 INFO L496 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:47,599 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2023-11-06 22:43:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-06 22:43:47,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:47,603 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:47,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:43:47,603 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:47,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash -551735173, now seen corresponding path program 1 times [2023-11-06 22:43:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814066040] [2023-11-06 22:43:47,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:48,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:49,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:49,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814066040] [2023-11-06 22:43:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814066040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:49,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:49,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:43:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889761074] [2023-11-06 22:43:49,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:49,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:43:49,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:49,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:43:49,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:43:49,116 INFO L87 Difference]: Start difference. First operand 135 states and 196 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:49,660 INFO L93 Difference]: Finished difference Result 304 states and 440 transitions. [2023-11-06 22:43:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:43:49,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2023-11-06 22:43:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:49,662 INFO L225 Difference]: With dead ends: 304 [2023-11-06 22:43:49,663 INFO L226 Difference]: Without dead ends: 172 [2023-11-06 22:43:49,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:43:49,664 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 380 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:49,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 348 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:43:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-06 22:43:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 122. [2023-11-06 22:43:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:43:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2023-11-06 22:43:49,679 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 145 [2023-11-06 22:43:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:49,680 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2023-11-06 22:43:49,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2023-11-06 22:43:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-06 22:43:49,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:49,682 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:49,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:43:49,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:49,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:49,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1019228512, now seen corresponding path program 1 times [2023-11-06 22:43:49,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:49,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387370773] [2023-11-06 22:43:49,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:49,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:50,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387370773] [2023-11-06 22:43:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387370773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:50,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:43:50,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507020125] [2023-11-06 22:43:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:50,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:43:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:50,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:43:50,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:43:50,799 INFO L87 Difference]: Start difference. First operand 122 states and 175 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:51,505 INFO L93 Difference]: Finished difference Result 334 states and 477 transitions. [2023-11-06 22:43:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:43:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2023-11-06 22:43:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:51,508 INFO L225 Difference]: With dead ends: 334 [2023-11-06 22:43:51,508 INFO L226 Difference]: Without dead ends: 215 [2023-11-06 22:43:51,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:43:51,509 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 349 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:51,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 526 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:43:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-06 22:43:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2023-11-06 22:43:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 119 states have (on average 1.403361344537815) internal successors, (167), 119 states have internal predecessors, (167), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:43:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2023-11-06 22:43:51,525 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 146 [2023-11-06 22:43:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:51,526 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2023-11-06 22:43:51,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2023-11-06 22:43:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-06 22:43:51,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:51,528 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:51,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:43:51,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:51,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:51,529 INFO L85 PathProgramCache]: Analyzing trace with hash 800283799, now seen corresponding path program 1 times [2023-11-06 22:43:51,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:51,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29720205] [2023-11-06 22:43:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:51,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:52,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:52,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29720205] [2023-11-06 22:43:52,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29720205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:52,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:52,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:43:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198346971] [2023-11-06 22:43:52,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:52,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:52,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:52,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:52,250 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:52,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:52,615 INFO L93 Difference]: Finished difference Result 409 states and 598 transitions. [2023-11-06 22:43:52,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:43:52,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2023-11-06 22:43:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:52,619 INFO L225 Difference]: With dead ends: 409 [2023-11-06 22:43:52,619 INFO L226 Difference]: Without dead ends: 274 [2023-11-06 22:43:52,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:43:52,622 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 122 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:52,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 456 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:43:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-11-06 22:43:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 219. [2023-11-06 22:43:52,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-06 22:43:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 317 transitions. [2023-11-06 22:43:52,672 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 317 transitions. Word has length 147 [2023-11-06 22:43:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:52,672 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 317 transitions. [2023-11-06 22:43:52,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 317 transitions. [2023-11-06 22:43:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-06 22:43:52,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:52,676 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:52,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:43:52,676 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:52,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash 962879533, now seen corresponding path program 1 times [2023-11-06 22:43:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608959395] [2023-11-06 22:43:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:52,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:53,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:53,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608959395] [2023-11-06 22:43:53,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608959395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:53,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:53,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:43:53,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190606482] [2023-11-06 22:43:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:53,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:53,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:53,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:53,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:53,242 INFO L87 Difference]: Start difference. First operand 219 states and 317 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:53,657 INFO L93 Difference]: Finished difference Result 488 states and 695 transitions. [2023-11-06 22:43:53,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:43:53,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2023-11-06 22:43:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:53,662 INFO L225 Difference]: With dead ends: 488 [2023-11-06 22:43:53,662 INFO L226 Difference]: Without dead ends: 353 [2023-11-06 22:43:53,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:53,665 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 177 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:53,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 580 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:43:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-11-06 22:43:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 267. [2023-11-06 22:43:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 226 states have (on average 1.3539823008849559) internal successors, (306), 227 states have internal predecessors, (306), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:43:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 378 transitions. [2023-11-06 22:43:53,713 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 378 transitions. Word has length 149 [2023-11-06 22:43:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:53,718 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 378 transitions. [2023-11-06 22:43:53,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 378 transitions. [2023-11-06 22:43:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-06 22:43:53,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:53,721 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:53,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:43:53,721 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:53,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1181734251, now seen corresponding path program 1 times [2023-11-06 22:43:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820330212] [2023-11-06 22:43:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:54,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:54,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820330212] [2023-11-06 22:43:54,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820330212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:54,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:54,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:43:54,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518143549] [2023-11-06 22:43:54,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:54,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:43:54,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:43:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:43:54,246 INFO L87 Difference]: Start difference. First operand 267 states and 378 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:54,747 INFO L93 Difference]: Finished difference Result 570 states and 804 transitions. [2023-11-06 22:43:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:43:54,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2023-11-06 22:43:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:54,752 INFO L225 Difference]: With dead ends: 570 [2023-11-06 22:43:54,753 INFO L226 Difference]: Without dead ends: 391 [2023-11-06 22:43:54,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:43:54,754 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 348 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:54,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 905 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:43:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-06 22:43:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 271. [2023-11-06 22:43:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 230 states have (on average 1.3478260869565217) internal successors, (310), 231 states have internal predecessors, (310), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:43:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 382 transitions. [2023-11-06 22:43:54,793 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 382 transitions. Word has length 149 [2023-11-06 22:43:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:54,794 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 382 transitions. [2023-11-06 22:43:54,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 382 transitions. [2023-11-06 22:43:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-06 22:43:54,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:54,797 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:54,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:43:54,797 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:54,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash -510677648, now seen corresponding path program 1 times [2023-11-06 22:43:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:54,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848228212] [2023-11-06 22:43:54,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:55,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:55,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848228212] [2023-11-06 22:43:55,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848228212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:55,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:55,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:43:55,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665153532] [2023-11-06 22:43:55,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:55,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:43:55,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:55,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:43:55,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:43:55,771 INFO L87 Difference]: Start difference. First operand 271 states and 382 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:56,130 INFO L93 Difference]: Finished difference Result 591 states and 830 transitions. [2023-11-06 22:43:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:43:56,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2023-11-06 22:43:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:56,135 INFO L225 Difference]: With dead ends: 591 [2023-11-06 22:43:56,136 INFO L226 Difference]: Without dead ends: 412 [2023-11-06 22:43:56,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:43:56,137 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 131 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:56,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 648 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:43:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-11-06 22:43:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 334. [2023-11-06 22:43:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 293 states have (on average 1.3549488054607508) internal successors, (397), 294 states have internal predecessors, (397), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:43:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 469 transitions. [2023-11-06 22:43:56,185 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 469 transitions. Word has length 150 [2023-11-06 22:43:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:56,185 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 469 transitions. [2023-11-06 22:43:56,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 469 transitions. [2023-11-06 22:43:56,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-06 22:43:56,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:56,189 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:56,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:43:56,189 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:56,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash -227402299, now seen corresponding path program 1 times [2023-11-06 22:43:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:56,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040776404] [2023-11-06 22:43:56,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:57,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040776404] [2023-11-06 22:43:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040776404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:57,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:57,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:43:57,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146245626] [2023-11-06 22:43:57,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:57,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:43:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:43:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:43:57,432 INFO L87 Difference]: Start difference. First operand 334 states and 469 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:58,022 INFO L93 Difference]: Finished difference Result 619 states and 874 transitions. [2023-11-06 22:43:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:43:58,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2023-11-06 22:43:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:58,026 INFO L225 Difference]: With dead ends: 619 [2023-11-06 22:43:58,026 INFO L226 Difference]: Without dead ends: 387 [2023-11-06 22:43:58,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:43:58,027 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 286 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:58,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 426 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:43:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-11-06 22:43:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 286. [2023-11-06 22:43:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 245 states have (on average 1.3265306122448979) internal successors, (325), 246 states have internal predecessors, (325), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:43:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 397 transitions. [2023-11-06 22:43:58,071 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 397 transitions. Word has length 150 [2023-11-06 22:43:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:58,072 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 397 transitions. [2023-11-06 22:43:58,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 397 transitions. [2023-11-06 22:43:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-06 22:43:58,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:58,075 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:58,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:43:58,075 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:58,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1118493419, now seen corresponding path program 1 times [2023-11-06 22:43:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:58,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408649673] [2023-11-06 22:43:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408649673] [2023-11-06 22:43:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408649673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:58,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:43:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320982089] [2023-11-06 22:43:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:58,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:43:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:43:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:43:58,206 INFO L87 Difference]: Start difference. First operand 286 states and 397 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:58,251 INFO L93 Difference]: Finished difference Result 527 states and 735 transitions. [2023-11-06 22:43:58,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:43:58,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2023-11-06 22:43:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:58,254 INFO L225 Difference]: With dead ends: 527 [2023-11-06 22:43:58,254 INFO L226 Difference]: Without dead ends: 326 [2023-11-06 22:43:58,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:43:58,256 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 20 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:58,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 321 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:43:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-11-06 22:43:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 290. [2023-11-06 22:43:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 249 states have (on average 1.321285140562249) internal successors, (329), 250 states have internal predecessors, (329), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:43:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 401 transitions. [2023-11-06 22:43:58,296 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 401 transitions. Word has length 152 [2023-11-06 22:43:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:58,297 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 401 transitions. [2023-11-06 22:43:58,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 401 transitions. [2023-11-06 22:43:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-06 22:43:58,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:58,299 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:58,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:43:58,300 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:58,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash 803941248, now seen corresponding path program 1 times [2023-11-06 22:43:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:58,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235739024] [2023-11-06 22:43:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:43:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:43:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:43:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:43:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:43:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:43:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:43:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:43:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:43:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:43:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:43:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:43:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:43:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:43:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:43:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:43:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:43:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:43:59,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:59,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235739024] [2023-11-06 22:43:59,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235739024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:59,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:59,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:43:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641220221] [2023-11-06 22:43:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:59,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:43:59,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:59,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:43:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:59,136 INFO L87 Difference]: Start difference. First operand 290 states and 401 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:43:59,494 INFO L93 Difference]: Finished difference Result 505 states and 701 transitions. [2023-11-06 22:43:59,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:43:59,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2023-11-06 22:43:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:43:59,497 INFO L225 Difference]: With dead ends: 505 [2023-11-06 22:43:59,497 INFO L226 Difference]: Without dead ends: 300 [2023-11-06 22:43:59,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:43:59,498 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 254 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:43:59,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 353 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:43:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-06 22:43:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2023-11-06 22:43:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 253 states have (on average 1.316205533596838) internal successors, (333), 254 states have internal predecessors, (333), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:43:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 405 transitions. [2023-11-06 22:43:59,547 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 405 transitions. Word has length 152 [2023-11-06 22:43:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:43:59,547 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 405 transitions. [2023-11-06 22:43:59,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:43:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 405 transitions. [2023-11-06 22:43:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-06 22:43:59,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:43:59,550 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:59,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:43:59,550 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:43:59,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash -972913156, now seen corresponding path program 1 times [2023-11-06 22:43:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:59,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357886184] [2023-11-06 22:43:59,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:59,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:44:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:44:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:44:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:44:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:44:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:44:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:44:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:44:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:44:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:44:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:44:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:44:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:44:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:44:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:44:01,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:01,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357886184] [2023-11-06 22:44:01,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357886184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:01,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:01,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:44:01,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289220592] [2023-11-06 22:44:01,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:01,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:44:01,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:01,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:44:01,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:44:01,388 INFO L87 Difference]: Start difference. First operand 294 states and 405 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:44:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:02,700 INFO L93 Difference]: Finished difference Result 375 states and 523 transitions. [2023-11-06 22:44:02,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:44:02,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2023-11-06 22:44:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:02,704 INFO L225 Difference]: With dead ends: 375 [2023-11-06 22:44:02,704 INFO L226 Difference]: Without dead ends: 373 [2023-11-06 22:44:02,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:44:02,706 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 242 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:02,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 672 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:44:02,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-11-06 22:44:02,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 300. [2023-11-06 22:44:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 259 states have (on average 1.308880308880309) internal successors, (339), 260 states have internal predecessors, (339), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:44:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 411 transitions. [2023-11-06 22:44:02,772 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 411 transitions. Word has length 152 [2023-11-06 22:44:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:02,772 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 411 transitions. [2023-11-06 22:44:02,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:44:02,773 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 411 transitions. [2023-11-06 22:44:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-06 22:44:02,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:02,776 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:02,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:44:02,776 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:02,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -971066114, now seen corresponding path program 1 times [2023-11-06 22:44:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75809936] [2023-11-06 22:44:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:02,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:44:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:44:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:44:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:44:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:44:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:44:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:44:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:44:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:44:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:05,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:44:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:06,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:44:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:06,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:44:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:44:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:06,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:44:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:44:06,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:06,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75809936] [2023-11-06 22:44:06,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75809936] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:44:06,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110941364] [2023-11-06 22:44:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:06,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:44:06,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:44:06,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:44:06,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:44:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:06,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 22:44:06,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:44:06,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:44:06,829 INFO L351 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 18 treesize of output 13 [2023-11-06 22:44:07,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:44:07,073 INFO L351 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 18 treesize of output 13 [2023-11-06 22:44:07,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:44:07,298 INFO L351 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 18 treesize of output 13 [2023-11-06 22:44:07,459 INFO L351 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 [2023-11-06 22:44:07,609 INFO L351 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 [2023-11-06 22:44:07,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:44:07,766 INFO L351 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 18 treesize of output 13 [2023-11-06 22:44:07,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:44:07,902 INFO L351 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 18 treesize of output 13 [2023-11-06 22:44:08,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:44:08,188 INFO L351 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 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:44:08,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:44:08,350 INFO L351 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 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:44:08,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:44:08,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-06 22:44:08,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:44:08,683 INFO L351 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 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-06 22:44:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 61 proven. 396 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-11-06 22:44:08,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:44:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110941364] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:44:08,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:44:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2023-11-06 22:44:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885854850] [2023-11-06 22:44:08,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:44:08,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 22:44:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:08,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 22:44:08,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:44:08,954 INFO L87 Difference]: Start difference. First operand 300 states and 411 transitions. Second operand has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 20 states have internal predecessors, (147), 11 states have call successors, (34), 6 states have call predecessors, (34), 8 states have return successors, (34), 8 states have call predecessors, (34), 11 states have call successors, (34) [2023-11-06 22:44:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:11,614 INFO L93 Difference]: Finished difference Result 548 states and 745 transitions. [2023-11-06 22:44:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:44:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 20 states have internal predecessors, (147), 11 states have call successors, (34), 6 states have call predecessors, (34), 8 states have return successors, (34), 8 states have call predecessors, (34), 11 states have call successors, (34) Word has length 152 [2023-11-06 22:44:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:11,620 INFO L225 Difference]: With dead ends: 548 [2023-11-06 22:44:11,620 INFO L226 Difference]: Without dead ends: 316 [2023-11-06 22:44:11,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:44:11,622 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 236 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:11,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1150 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:44:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-06 22:44:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 306. [2023-11-06 22:44:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 264 states have (on average 1.303030303030303) internal successors, (344), 265 states have internal predecessors, (344), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:44:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 416 transitions. [2023-11-06 22:44:11,676 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 416 transitions. Word has length 152 [2023-11-06 22:44:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:11,676 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 416 transitions. [2023-11-06 22:44:11,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 20 states have internal predecessors, (147), 11 states have call successors, (34), 6 states have call predecessors, (34), 8 states have return successors, (34), 8 states have call predecessors, (34), 11 states have call successors, (34) [2023-11-06 22:44:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 416 transitions. [2023-11-06 22:44:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-06 22:44:11,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:11,679 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:11,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:44:11,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:44:11,888 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:11,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1882823225, now seen corresponding path program 1 times [2023-11-06 22:44:11,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:11,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044099526] [2023-11-06 22:44:11,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:11,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:44:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:44:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:44:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:44:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:44:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:44:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:44:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:44:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:44:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:44:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:44:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:44:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:44:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:44:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:44:15,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:15,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044099526] [2023-11-06 22:44:15,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044099526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:15,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:15,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:44:15,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423580715] [2023-11-06 22:44:15,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:15,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:44:15,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:15,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:44:15,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:44:15,621 INFO L87 Difference]: Start difference. First operand 306 states and 416 transitions. Second operand has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-06 22:44:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:17,874 INFO L93 Difference]: Finished difference Result 939 states and 1275 transitions. [2023-11-06 22:44:17,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:44:17,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 154 [2023-11-06 22:44:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:17,880 INFO L225 Difference]: With dead ends: 939 [2023-11-06 22:44:17,880 INFO L226 Difference]: Without dead ends: 724 [2023-11-06 22:44:17,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:44:17,882 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 287 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:17,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 732 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:44:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2023-11-06 22:44:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 654. [2023-11-06 22:44:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 591 states have (on average 1.3265651438240271) internal successors, (784), 593 states have internal predecessors, (784), 55 states have call successors, (55), 7 states have call predecessors, (55), 7 states have return successors, (55), 53 states have call predecessors, (55), 55 states have call successors, (55) [2023-11-06 22:44:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 894 transitions. [2023-11-06 22:44:17,982 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 894 transitions. Word has length 154 [2023-11-06 22:44:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:17,983 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 894 transitions. [2023-11-06 22:44:17,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-06 22:44:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 894 transitions. [2023-11-06 22:44:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-06 22:44:17,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:17,986 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:17,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:44:17,986 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:17,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1284046372, now seen corresponding path program 1 times [2023-11-06 22:44:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:17,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207078842] [2023-11-06 22:44:17,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:44:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:44:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:44:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:44:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:44:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:44:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:44:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:44:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:44:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:44:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:44:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:44:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:44:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:44:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:44:18,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:18,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207078842] [2023-11-06 22:44:18,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207078842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:18,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:18,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:44:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997160217] [2023-11-06 22:44:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:18,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:44:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:44:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:44:18,959 INFO L87 Difference]: Start difference. First operand 654 states and 894 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:44:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:19,875 INFO L93 Difference]: Finished difference Result 1392 states and 1895 transitions. [2023-11-06 22:44:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:44:19,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2023-11-06 22:44:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:19,882 INFO L225 Difference]: With dead ends: 1392 [2023-11-06 22:44:19,882 INFO L226 Difference]: Without dead ends: 866 [2023-11-06 22:44:19,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:44:19,884 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 307 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:19,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 503 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:44:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2023-11-06 22:44:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 606. [2023-11-06 22:44:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 545 states have (on average 1.3137614678899083) internal successors, (716), 546 states have internal predecessors, (716), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-06 22:44:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 822 transitions. [2023-11-06 22:44:19,983 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 822 transitions. Word has length 154 [2023-11-06 22:44:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:19,983 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 822 transitions. [2023-11-06 22:44:19,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:44:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 822 transitions. [2023-11-06 22:44:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-06 22:44:19,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:19,987 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:19,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:44:19,987 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:19,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1222667152, now seen corresponding path program 1 times [2023-11-06 22:44:19,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:19,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252866163] [2023-11-06 22:44:19,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:19,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:44:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:44:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:44:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:44:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:44:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:44:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:44:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:44:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:44:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:44:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:44:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:44:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:44:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:44:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:44:20,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:20,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252866163] [2023-11-06 22:44:20,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252866163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:20,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:20,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:44:20,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949743044] [2023-11-06 22:44:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:20,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:44:20,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:44:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:44:20,111 INFO L87 Difference]: Start difference. First operand 606 states and 822 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:44:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:20,209 INFO L93 Difference]: Finished difference Result 1112 states and 1516 transitions. [2023-11-06 22:44:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:44:20,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2023-11-06 22:44:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:20,216 INFO L225 Difference]: With dead ends: 1112 [2023-11-06 22:44:20,217 INFO L226 Difference]: Without dead ends: 613 [2023-11-06 22:44:20,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:44:20,221 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 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 [2023-11-06 22:44:20,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:44:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2023-11-06 22:44:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2023-11-06 22:44:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 552 states have (on average 1.309782608695652) internal successors, (723), 553 states have internal predecessors, (723), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-06 22:44:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 829 transitions. [2023-11-06 22:44:20,315 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 829 transitions. Word has length 154 [2023-11-06 22:44:20,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:20,316 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 829 transitions. [2023-11-06 22:44:20,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:44:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 829 transitions. [2023-11-06 22:44:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-06 22:44:20,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:20,320 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:20,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:44:20,320 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:20,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:20,321 INFO L85 PathProgramCache]: Analyzing trace with hash -361160073, now seen corresponding path program 1 times [2023-11-06 22:44:20,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:20,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434030213] [2023-11-06 22:44:20,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:20,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:44:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:44:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:44:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:44:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:44:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:44:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:44:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:44:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:44:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:44:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:44:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:44:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:44:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:44:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:44:21,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:21,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434030213] [2023-11-06 22:44:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434030213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:21,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:21,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:44:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715528858] [2023-11-06 22:44:21,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:21,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:44:21,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:21,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:44:21,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:44:21,352 INFO L87 Difference]: Start difference. First operand 613 states and 829 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-06 22:44:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:21,936 INFO L93 Difference]: Finished difference Result 1095 states and 1489 transitions. [2023-11-06 22:44:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:44:21,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 154 [2023-11-06 22:44:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:21,941 INFO L225 Difference]: With dead ends: 1095 [2023-11-06 22:44:21,941 INFO L226 Difference]: Without dead ends: 594 [2023-11-06 22:44:21,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:44:21,943 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 66 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:21,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 529 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:44:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2023-11-06 22:44:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2023-11-06 22:44:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 533 states have (on average 1.3114446529080674) internal successors, (699), 534 states have internal predecessors, (699), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-06 22:44:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 805 transitions. [2023-11-06 22:44:22,039 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 805 transitions. Word has length 154 [2023-11-06 22:44:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:22,039 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 805 transitions. [2023-11-06 22:44:22,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-06 22:44:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 805 transitions. [2023-11-06 22:44:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-06 22:44:22,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:22,042 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:22,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:44:22,043 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:22,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:22,043 INFO L85 PathProgramCache]: Analyzing trace with hash -631437127, now seen corresponding path program 1 times [2023-11-06 22:44:22,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:22,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746716036] [2023-11-06 22:44:22,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:22,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:44:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:44:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:44:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:44:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:44:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:44:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:44:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:44:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:44:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:44:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:44:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:44:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:44:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:44:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:44:22,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:22,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746716036] [2023-11-06 22:44:22,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746716036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:22,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:22,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:44:22,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846868564] [2023-11-06 22:44:22,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:22,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:44:22,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:22,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:44:22,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:44:22,493 INFO L87 Difference]: Start difference. First operand 594 states and 805 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:44:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:22,980 INFO L93 Difference]: Finished difference Result 900 states and 1225 transitions. [2023-11-06 22:44:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:44:22,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2023-11-06 22:44:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:22,985 INFO L225 Difference]: With dead ends: 900 [2023-11-06 22:44:22,985 INFO L226 Difference]: Without dead ends: 618 [2023-11-06 22:44:22,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:44:22,988 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 148 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:22,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 344 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:44:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2023-11-06 22:44:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 603. [2023-11-06 22:44:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 542 states have (on average 1.311808118081181) internal successors, (711), 543 states have internal predecessors, (711), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-06 22:44:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 817 transitions. [2023-11-06 22:44:23,091 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 817 transitions. Word has length 154 [2023-11-06 22:44:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:23,092 INFO L495 AbstractCegarLoop]: Abstraction has 603 states and 817 transitions. [2023-11-06 22:44:23,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:44:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 817 transitions. [2023-11-06 22:44:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-06 22:44:23,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:23,095 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:23,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:44:23,096 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:23,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2003244425, now seen corresponding path program 1 times [2023-11-06 22:44:23,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:23,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371703214] [2023-11-06 22:44:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:23,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:44:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:44:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:44:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:44:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:44:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:44:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:44:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:44:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:44:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:44:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:44:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:44:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:44:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:44:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:44:23,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:23,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371703214] [2023-11-06 22:44:23,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371703214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:23,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:23,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:44:23,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595103074] [2023-11-06 22:44:23,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:23,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:44:23,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:23,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:44:23,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:44:23,545 INFO L87 Difference]: Start difference. First operand 603 states and 817 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:44:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:24,055 INFO L93 Difference]: Finished difference Result 1325 states and 1785 transitions. [2023-11-06 22:44:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:44:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2023-11-06 22:44:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:24,061 INFO L225 Difference]: With dead ends: 1325 [2023-11-06 22:44:24,061 INFO L226 Difference]: Without dead ends: 786 [2023-11-06 22:44:24,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:44:24,063 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 120 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:24,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 715 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:44:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2023-11-06 22:44:24,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 602. [2023-11-06 22:44:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 541 states have (on average 1.3086876155268021) internal successors, (708), 542 states have internal predecessors, (708), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-06 22:44:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 814 transitions. [2023-11-06 22:44:24,157 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 814 transitions. Word has length 154 [2023-11-06 22:44:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:24,158 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 814 transitions. [2023-11-06 22:44:24,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:44:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 814 transitions. [2023-11-06 22:44:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 22:44:24,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:24,161 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:24,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:44:24,161 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:24,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1359770283, now seen corresponding path program 1 times [2023-11-06 22:44:24,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:24,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229831389] [2023-11-06 22:44:24,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:44:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:44:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:44:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:44:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:44:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:44:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:44:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:44:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:44:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:44:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:44:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:44:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:44:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:44:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:44:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229831389] [2023-11-06 22:44:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229831389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:24,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:24,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:44:24,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456867134] [2023-11-06 22:44:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:24,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:44:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:44:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:44:24,767 INFO L87 Difference]: Start difference. First operand 602 states and 814 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:44:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:25,283 INFO L93 Difference]: Finished difference Result 1406 states and 1884 transitions. [2023-11-06 22:44:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:44:25,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2023-11-06 22:44:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:25,290 INFO L225 Difference]: With dead ends: 1406 [2023-11-06 22:44:25,291 INFO L226 Difference]: Without dead ends: 918 [2023-11-06 22:44:25,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:44:25,294 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 450 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:25,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 328 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:44:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2023-11-06 22:44:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 700. [2023-11-06 22:44:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 639 states have (on average 1.3035993740219092) internal successors, (833), 640 states have internal predecessors, (833), 53 states have call successors, (53), 7 states have call predecessors, (53), 7 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-06 22:44:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 939 transitions. [2023-11-06 22:44:25,396 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 939 transitions. Word has length 156 [2023-11-06 22:44:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:25,396 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 939 transitions. [2023-11-06 22:44:25,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:44:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 939 transitions. [2023-11-06 22:44:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 22:44:25,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:25,399 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:25,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:44:25,400 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:25,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash 406563262, now seen corresponding path program 1 times [2023-11-06 22:44:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:25,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97216176] [2023-11-06 22:44:25,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:44:25,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:44:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:44:25,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:44:25,876 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:44:25,877 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:44:25,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:44:25,883 INFO L445 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] [2023-11-06 22:44:25,887 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:44:26,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:44:26 BoogieIcfgContainer [2023-11-06 22:44:26,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:44:26,040 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:44:26,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:44:26,041 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:44:26,041 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:42" (3/4) ... [2023-11-06 22:44:26,043 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:44:26,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:44:26,049 INFO L158 Benchmark]: Toolchain (without parser) took 44955.73ms. Allocated memory was 146.8MB in the beginning and 654.3MB in the end (delta: 507.5MB). Free memory was 106.2MB in the beginning and 423.7MB in the end (delta: -317.4MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. [2023-11-06 22:44:26,050 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 109.1MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:44:26,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.98ms. Allocated memory is still 146.8MB. Free memory was 105.9MB in the beginning and 90.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:44:26,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.32ms. Allocated memory is still 146.8MB. Free memory was 90.7MB in the beginning and 86.9MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:44:26,050 INFO L158 Benchmark]: Boogie Preprocessor took 77.34ms. Allocated memory is still 146.8MB. Free memory was 86.9MB in the beginning and 83.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:44:26,051 INFO L158 Benchmark]: RCFGBuilder took 963.08ms. Allocated memory is still 146.8MB. Free memory was 83.4MB in the beginning and 96.0MB in the end (delta: -12.6MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-11-06 22:44:26,051 INFO L158 Benchmark]: TraceAbstraction took 43345.68ms. Allocated memory was 146.8MB in the beginning and 654.3MB in the end (delta: 507.5MB). Free memory was 95.5MB in the beginning and 423.7MB in the end (delta: -328.2MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. [2023-11-06 22:44:26,051 INFO L158 Benchmark]: Witness Printer took 8.15ms. Allocated memory is still 654.3MB. Free memory is still 423.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:44:26,053 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.34ms. Allocated memory is still 109.1MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.98ms. Allocated memory is still 146.8MB. Free memory was 105.9MB in the beginning and 90.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.32ms. Allocated memory is still 146.8MB. Free memory was 90.7MB in the beginning and 86.9MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.34ms. Allocated memory is still 146.8MB. Free memory was 86.9MB in the beginning and 83.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 963.08ms. Allocated memory is still 146.8MB. Free memory was 83.4MB in the beginning and 96.0MB in the end (delta: -12.6MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 43345.68ms. Allocated memory was 146.8MB in the beginning and 654.3MB in the end (delta: 507.5MB). Free memory was 95.5MB in the beginning and 423.7MB in the end (delta: -328.2MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. * Witness Printer took 8.15ms. Allocated memory is still 654.3MB. Free memory is still 423.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of bitwiseOr at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2] = { 1000000.5, 4.5 }; [L28-L30] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 64 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { -16 }; [L37-L39] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L43] signed short int last_1_signed_short_int_Array_0_0_ = -16; [L44] unsigned char last_1_unsigned_char_Array_0_0_ = 0; [L45] unsigned long int last_1_unsigned_long_int_Array_0_0__1_ = 25; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L103] EXPR signed_short_int_Array_0[0] [L103] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L104] EXPR unsigned_char_Array_0[0] [L104] last_1_unsigned_char_Array_0_0_ = unsigned_char_Array_0[0] [L105] EXPR unsigned_long_int_Array_0[0][1] [L105] last_1_unsigned_long_int_Array_0_0__1_ = unsigned_long_int_Array_0[0][1] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=257, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L76] 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[0]=257, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=257, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L77] 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[0]=257, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L79] 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[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L80] 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[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L81] float_Array_0[1] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[1]=4294967299, float_Array_0[1]=4294967299, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [(float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F=1, float_Array_0[1]=4294967299, float_Array_0[1]=4294967299, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L82] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [(float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F=1, float_Array_0[1]=4294967299, float_Array_0[1]=4294967299, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L83] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][0]=126, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][0]=126, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][0]=126, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][0]=126, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L86] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L89] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L90] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0[1]=11, unsigned_long_int_Array_0={10:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0[1]=11, unsigned_long_int_Array_0={10:0}] [L91] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0[1]=11, unsigned_long_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0[1]=11, unsigned_long_int_Array_0={10:0}] [L92] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769] [L94] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769] [L95] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[1][0]=-3221225473] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[1][0]=-3221225473] [L97] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[1][0]=-3221225473] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[1][0]=-3221225473] [L98] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L99] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[1][1]=-2] [L99] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L99] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[1][1]=-2] [L100] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[1][1]=-2] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[1][1]=-2] [L116] RET updateVariables() [L117] CALL step() [L49] EXPR last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] [L49] EXPR BOOL_unsigned_char_Array_0[1] [L49] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L49] COND FALSE !(((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) [L56] EXPR signed_char_Array_0[0][1] [L56] signed_char_Array_0[1][1] = signed_char_Array_0[0][1] [L58] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L58] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L61] EXPR unsigned_long_int_Array_0[0][0] [L61] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[1][0]=-50, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769] [L61] COND TRUE unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0] [L62] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[1][0]=-50, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L62] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) [L62] EXPR signed_char_Array_0[1][0] [L62] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) VAL [((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0])=50, BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L62] signed_long_int_Array_0[0] = ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))) [L64] signed_short_int_Array_0[0] = 2 [L65] EXPR float_Array_0[1] [L65] float_Array_0[0] = float_Array_0[1] [L66] EXPR unsigned_char_Array_0[1] [L66] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L67] EXPR signed_char_Array_0[1][0] [L67] EXPR signed_char_Array_0[1][1] [L67] unsigned char stepLocal_0 = signed_char_Array_0[1][0] < signed_char_Array_0[1][1]; [L68] stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, stepLocal_0=0, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L68] COND FALSE !(stepLocal_0 && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) [L71] EXPR unsigned_long_int_Array_0[1][1] [L71] EXPR unsigned_long_int_Array_0[1][0] [L71] unsigned_long_int_Array_0[0][1] = (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]) [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] [L108] EXPR BOOL_unsigned_char_Array_0[1] [L108] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1] VAL [((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) [L108] EXPR signed_char_Array_0[1][1] [L108] EXPR signed_char_Array_0[0][1] [L108] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) VAL [(((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) [L108] EXPR BOOL_unsigned_char_Array_0[1] VAL [((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1 VAL [((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1) VAL [((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) [L108] EXPR signed_char_Array_0[1][0] [L108] EXPR signed_char_Array_0[1][1] [L108] EXPR (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1]) VAL [(((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L108] EXPR ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))) [L108] EXPR unsigned_long_int_Array_0[0][1] [L108] EXPR unsigned_long_int_Array_0[1][1] [L108] EXPR unsigned_long_int_Array_0[1][0] [L108] EXPR ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))) VAL [(((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))=1, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][1]=3221225471, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_long_int_Array_0[1][1]=-2] [L108] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))) VAL [(((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))=1, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][1]=3221225471, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_long_int_Array_0[1][1]=-2] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) [L108] EXPR unsigned_long_int_Array_0[0][0] [L108] EXPR signed_char_Array_0[1][0] VAL [((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)=1, (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))=1, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769, unsigned_long_int_Array_0[0][1]=3221225471, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_long_int_Array_0[1][1]=-2] [L108] EXPR (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1 [L108] EXPR signed_long_int_Array_0[0] [L108] EXPR signed_char_Array_0[1][0] VAL [((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)=1, (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))=1, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=50, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769, unsigned_long_int_Array_0[0][1]=3221225471, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_long_int_Array_0[1][1]=-2] [L108] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) [L108] EXPR signed_char_Array_0[1][0] [L108] EXPR ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]) VAL [((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)=1, (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))=1, ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0])=50, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=50, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769, unsigned_long_int_Array_0[0][1]=3221225471, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_long_int_Array_0[1][1]=-2] [L108] EXPR (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1 VAL [((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)=1, (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))=1, ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0])=50, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=50, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769, unsigned_long_int_Array_0[0][1]=3221225471, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_long_int_Array_0[1][1]=-2] [L108] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1) VAL [((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)=1, (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))=1, ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0])=50, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=50, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769, unsigned_long_int_Array_0[0][1]=3221225471, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_long_int_Array_0[1][1]=-2] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) [L108] EXPR signed_short_int_Array_0[0] [L108] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2)) VAL [(((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))=1, ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)=1, (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))=1, ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0])=50, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=50, signed_short_int_Array_0={8:0}, signed_short_int_Array_0[0]=2, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769, unsigned_long_int_Array_0[0][1]=3221225471, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_long_int_Array_0[1][1]=-2] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) [L108] EXPR float_Array_0[0] [L108] EXPR float_Array_0[1] [L108] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [(((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))=1, ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)=1, (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))=1, ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0])=50, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, float_Array_0[0]=4294967299, float_Array_0[1]=4294967299, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=50, signed_short_int_Array_0={8:0}, signed_short_int_Array_0[0]=2, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769, unsigned_long_int_Array_0[0][1]=3221225471, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_long_int_Array_0[1][1]=-2] [L108] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [(((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))=0, ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))=0, (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))=1, ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)=1, (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))=1, ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)=1, (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))=1, ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]=0, ((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0])))=1, ((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0])=50, (signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])=0, (unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1=1, BOOL_unsigned_char_Array_0[1]=256, BOOL_unsigned_char_Array_0[1]=256, float_Array_0={5:0}, float_Array_0[0]=4294967299, float_Array_0[1]=4294967299, isInitial=1, last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_=4294967280, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0[0][1]=-51, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][0]=-50, signed_char_Array_0[1][1]=-51, signed_char_Array_0[1][1]=-51, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=50, signed_short_int_Array_0={8:0}, signed_short_int_Array_0[0]=2, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0[0][0]=-7516192769, unsigned_long_int_Array_0[0][1]=3221225471, unsigned_long_int_Array_0[1][0]=-3221225473, unsigned_long_int_Array_0[1][1]=-2] [L108-L109] return (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][0] == ((signed char) ((((signed_char_Array_0[0][1]) > (signed_char_Array_0[0][0])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[0][0]))))) : 1)) && (((signed_char_Array_0[1][0] < signed_char_Array_0[1][1]) && (((((signed_char_Array_0[0][0]) > (signed_char_Array_0[1][0])) ? (signed_char_Array_0[0][0]) : (signed_char_Array_0[1][0]))) == signed_char_Array_0[0][1])) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - (((((unsigned_long_int_Array_0[0][0]) > (unsigned_long_int_Array_0[1][0])) ? (unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[1][0]))) - 1u)))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_long_int_Array_0[1][1] - unsigned_long_int_Array_0[1][0]))))) && ((unsigned_long_int_Array_0[0][0] <= signed_char_Array_0[1][0]) ? (signed_long_int_Array_0[0] == ((signed long int) ((((signed_char_Array_0[1][0]) < 0 ) ? -(signed_char_Array_0[1][0]) : (signed_char_Array_0[1][0]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 2))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_char_Array_0={9:0}, unsigned_long_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.1s, OverallIterations: 24, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4623 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4622 mSDsluCounter, 12012 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8814 mSDsCounter, 433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8074 IncrementalHoareTripleChecker+Invalid, 8507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 433 mSolverCounterUnsat, 3198 mSDtfsCounter, 8074 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1258 GetRequests, 1065 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=700occurred in iteration=23, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 1547 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 3749 NumberOfCodeBlocks, 3749 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3569 ConstructedInterpolants, 0 QuantifiedInterpolants, 28286 SizeOfPredicates, 10 NumberOfNonLiveVariables, 542 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 12648/13056 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 [2023-11-06 22:44:26,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:44:28,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:44:28,871 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:44:28,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:44:28,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:44:28,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:44:28,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:44:28,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:44:28,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:44:28,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:44:28,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:44:28,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:44:28,910 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:44:28,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:44:28,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:44:28,912 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:44:28,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:44:28,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:44:28,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:44:28,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:44:28,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:44:28,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:44:28,917 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:44:28,917 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:44:28,918 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:44:28,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:44:28,919 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:44:28,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:44:28,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:44:28,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:44:28,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:44:28,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:44:28,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:44:28,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:44:28,924 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:44:28,924 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:44:28,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:44:28,925 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:44:28,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:44:28,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:44:28,926 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:44:28,926 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:44:28,927 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_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/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_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> ee043a380462a1c76ab3130ca5e702431f3ce27542f408d77a3f5f81e3836d71 [2023-11-06 22:44:29,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:44:29,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:44:29,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:44:29,327 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:44:29,327 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:44:29,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2023-11-06 22:44:32,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:44:32,890 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:44:32,891 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i [2023-11-06 22:44:32,905 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/data/e1df448ec/0f958a5c2e6f48c6af4c40d47ec3e22f/FLAGf379b6e4a [2023-11-06 22:44:32,920 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/data/e1df448ec/0f958a5c2e6f48c6af4c40d47ec3e22f [2023-11-06 22:44:32,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:44:32,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:44:32,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:44:32,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:44:32,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:44:32,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:44:32" (1/1) ... [2023-11-06 22:44:32,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0fe798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:32, skipping insertion in model container [2023-11-06 22:44:32,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:44:32" (1/1) ... [2023-11-06 22:44:32,966 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:44:33,166 WARN L240 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_55418f8d-e91e-43f9-af57-47dfeb57d716/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i[916,929] [2023-11-06 22:44:33,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:44:33,273 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:44:33,289 WARN L240 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_55418f8d-e91e-43f9-af57-47dfeb57d716/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-88.i[916,929] [2023-11-06 22:44:33,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:44:33,420 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:44:33,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33 WrapperNode [2023-11-06 22:44:33,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:44:33,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:44:33,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:44:33,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:44:33,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,519 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2023-11-06 22:44:33,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:44:33,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:44:33,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:44:33,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:44:33,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:44:33,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:44:33,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:44:33,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:44:33,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (1/1) ... [2023-11-06 22:44:33,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:44:33,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:44:33,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:44:33,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:44:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:44:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:44:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:44:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:44:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:44:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:44:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:44:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:44:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:44:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:44:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:44:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:44:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:44:33,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:44:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:44:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:44:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:44:33,854 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:44:33,857 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:44:34,602 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:44:34,611 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:44:34,611 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:44:34,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:34 BoogieIcfgContainer [2023-11-06 22:44:34,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:44:34,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:44:34,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:44:34,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:44:34,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:44:32" (1/3) ... [2023-11-06 22:44:34,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc5601c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:44:34, skipping insertion in model container [2023-11-06 22:44:34,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:33" (2/3) ... [2023-11-06 22:44:34,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc5601c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:44:34, skipping insertion in model container [2023-11-06 22:44:34,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:34" (3/3) ... [2023-11-06 22:44:34,626 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-88.i [2023-11-06 22:44:34,648 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:44:34,649 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:44:34,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:44:34,732 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@6d138adf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:44:34,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:44:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:44:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:44:34,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:34,765 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:34,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:34,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 441684127, now seen corresponding path program 1 times [2023-11-06 22:44:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:44:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068547917] [2023-11-06 22:44:34,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:34,850 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 [2023-11-06 22:44:34,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:44:34,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:44:34,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:44:35,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 139 [2023-11-06 22:44:35,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:44:35,378 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 22:44:35,383 INFO L158 Benchmark]: Toolchain (without parser) took 2457.52ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 47.0MB in the beginning and 59.4MB in the end (delta: -12.4MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2023-11-06 22:44:35,383 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 71.3MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:44:35,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.88ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 46.8MB in the beginning and 76.4MB in the end (delta: -29.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2023-11-06 22:44:35,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.28ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 72.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:44:35,386 INFO L158 Benchmark]: Boogie Preprocessor took 105.37ms. Allocated memory is still 100.7MB. Free memory was 72.9MB in the beginning and 69.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:44:35,387 INFO L158 Benchmark]: RCFGBuilder took 987.96ms. Allocated memory is still 100.7MB. Free memory was 69.4MB in the beginning and 35.2MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-06 22:44:35,387 INFO L158 Benchmark]: TraceAbstraction took 764.15ms. Allocated memory is still 100.7MB. Free memory was 34.5MB in the beginning and 59.4MB in the end (delta: -24.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:44:35,391 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.30ms. Allocated memory is still 71.3MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.88ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 46.8MB in the beginning and 76.4MB in the end (delta: -29.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.28ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 72.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.37ms. Allocated memory is still 100.7MB. Free memory was 72.9MB in the beginning and 69.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 987.96ms. Allocated memory is still 100.7MB. Free memory was 69.4MB in the beginning and 35.2MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 764.15ms. Allocated memory is still 100.7MB. Free memory was 34.5MB in the beginning and 59.4MB in the end (delta: -24.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:44:35,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55418f8d-e91e-43f9-af57-47dfeb57d716/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) with exit command (exit)) Received EOF on stdin. No stderr output.