./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/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_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/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_0d39fc7a-b489-46b2-a729-422538d0cc43/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 af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:54:22,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:54:22,522 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:54:22,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:54:22,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:54:22,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:54:22,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:54:22,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:54:22,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:54:22,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:54:22,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:54:22,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:54:22,600 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:54:22,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:54:22,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:54:22,603 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:54:22,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:54:22,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:54:22,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:54:22,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:54:22,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:54:22,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:54:22,608 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:54:22,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:54:22,609 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:54:22,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:54:22,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:54:22,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:54:22,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:22,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:54:22,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:54:22,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:54:22,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:54:22,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:54:22,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:54:22,614 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:54:22,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:54:22,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:54:22,614 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:54:22,615 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_0d39fc7a-b489-46b2-a729-422538d0cc43/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_0d39fc7a-b489-46b2-a729-422538d0cc43/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 -> af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a [2023-11-06 21:54:22,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:54:22,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:54:22,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:54:22,987 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:54:22,989 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:54:22,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-11-06 21:54:26,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:54:26,752 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:54:26,752 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-11-06 21:54:26,764 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/data/8c5fb4c77/7f8e51838aa24d9ea5cde4648bc36acb/FLAGeabd129c6 [2023-11-06 21:54:26,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/data/8c5fb4c77/7f8e51838aa24d9ea5cde4648bc36acb [2023-11-06 21:54:26,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:54:26,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:54:26,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:26,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:54:26,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:54:26,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:26" (1/1) ... [2023-11-06 21:54:26,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e2506fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:26, skipping insertion in model container [2023-11-06 21:54:26,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:26" (1/1) ... [2023-11-06 21:54:26,834 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:54:27,021 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_0d39fc7a-b489-46b2-a729-422538d0cc43/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2023-11-06 21:54:27,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:27,107 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:54:27,122 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_0d39fc7a-b489-46b2-a729-422538d0cc43/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2023-11-06 21:54:27,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:27,194 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:54:27,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27 WrapperNode [2023-11-06 21:54:27,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:27,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:27,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:54:27,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:54:27,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,279 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2023-11-06 21:54:27,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:27,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:54:27,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:54:27,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:54:27,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:54:27,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:54:27,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:54:27,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:54:27,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (1/1) ... [2023-11-06 21:54:27,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:27,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:27,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:54:27,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:54:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:54:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 21:54:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:54:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 21:54:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:54:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 21:54:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:54:27,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:54:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:54:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:54:27,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:54:27,684 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:54:27,688 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:54:28,465 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:54:28,482 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:54:28,482 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:54:28,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:28 BoogieIcfgContainer [2023-11-06 21:54:28,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:54:28,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:54:28,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:54:28,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:54:28,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:54:26" (1/3) ... [2023-11-06 21:54:28,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfbf8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:28, skipping insertion in model container [2023-11-06 21:54:28,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:27" (2/3) ... [2023-11-06 21:54:28,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfbf8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:28, skipping insertion in model container [2023-11-06 21:54:28,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:28" (3/3) ... [2023-11-06 21:54:28,496 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2023-11-06 21:54:28,518 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:54:28,518 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:54:28,575 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:54:28,582 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;@b512dcf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:54:28,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:54:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 21:54:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 21:54:28,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:28,605 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:28,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:28,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:28,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2045303348, now seen corresponding path program 1 times [2023-11-06 21:54:28,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:28,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170826623] [2023-11-06 21:54:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:28,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:28,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:28,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:28,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:28,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:28,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:28,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:28,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:29,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:29,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170826623] [2023-11-06 21:54:29,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170826623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:29,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:29,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:29,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385984490] [2023-11-06 21:54:29,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:29,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:54:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:29,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:54:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:54:29,166 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:54:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:29,247 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2023-11-06 21:54:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:54:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-11-06 21:54:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:29,266 INFO L225 Difference]: With dead ends: 219 [2023-11-06 21:54:29,266 INFO L226 Difference]: Without dead ends: 109 [2023-11-06 21:54:29,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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 21:54:29,281 INFO L413 NwaCegarLoop]: 157 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, 157 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 21:54:29,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:54:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-06 21:54:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-06 21:54:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 21:54:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2023-11-06 21:54:29,375 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2023-11-06 21:54:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:29,376 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2023-11-06 21:54:29,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:54:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2023-11-06 21:54:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 21:54:29,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:29,391 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:29,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:54:29,392 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:29,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash 523381052, now seen corresponding path program 1 times [2023-11-06 21:54:29,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:29,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623934841] [2023-11-06 21:54:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:29,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:29,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:30,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:30,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623934841] [2023-11-06 21:54:30,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623934841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:30,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:30,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:30,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849547009] [2023-11-06 21:54:30,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:30,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:30,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:30,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:30,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:30,064 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:30,114 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2023-11-06 21:54:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:30,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-06 21:54:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:30,124 INFO L225 Difference]: With dead ends: 213 [2023-11-06 21:54:30,124 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 21:54:30,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 21:54:30,128 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:30,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:54:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 21:54:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-06 21:54:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 21:54:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2023-11-06 21:54:30,146 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 115 [2023-11-06 21:54:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:30,154 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2023-11-06 21:54:30,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2023-11-06 21:54:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 21:54:30,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:30,163 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:30,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:54:30,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:30,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:30,165 INFO L85 PathProgramCache]: Analyzing trace with hash 395217285, now seen corresponding path program 1 times [2023-11-06 21:54:30,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:30,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166397771] [2023-11-06 21:54:30,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:30,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:30,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166397771] [2023-11-06 21:54:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166397771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:30,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756449687] [2023-11-06 21:54:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:30,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:30,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:30,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:30,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:30,465 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:30,514 INFO L93 Difference]: Finished difference Result 235 states and 338 transitions. [2023-11-06 21:54:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:30,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-06 21:54:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:30,523 INFO L225 Difference]: With dead ends: 235 [2023-11-06 21:54:30,524 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 21:54:30,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 21:54:30,541 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:30,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:54:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 21:54:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2023-11-06 21:54:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 21:54:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2023-11-06 21:54:30,568 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 115 [2023-11-06 21:54:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:30,569 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2023-11-06 21:54:30,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2023-11-06 21:54:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 21:54:30,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:30,572 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:30,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:54:30,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:30,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 653382723, now seen corresponding path program 1 times [2023-11-06 21:54:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651718992] [2023-11-06 21:54:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:31,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651718992] [2023-11-06 21:54:31,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651718992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:31,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:31,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:31,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888993257] [2023-11-06 21:54:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:31,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:54:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:54:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:31,457 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:31,967 INFO L93 Difference]: Finished difference Result 278 states and 395 transitions. [2023-11-06 21:54:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:54:31,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-06 21:54:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:31,981 INFO L225 Difference]: With dead ends: 278 [2023-11-06 21:54:31,981 INFO L226 Difference]: Without dead ends: 173 [2023-11-06 21:54:31,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:54:31,988 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 292 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:31,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 422 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:54:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-06 21:54:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 117. [2023-11-06 21:54:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 21:54:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2023-11-06 21:54:32,018 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 115 [2023-11-06 21:54:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:32,019 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2023-11-06 21:54:32,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2023-11-06 21:54:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 21:54:32,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:32,022 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:32,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:54:32,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:32,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:32,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1044361379, now seen corresponding path program 1 times [2023-11-06 21:54:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:32,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407490219] [2023-11-06 21:54:32,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:32,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407490219] [2023-11-06 21:54:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407490219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:32,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 21:54:32,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888033396] [2023-11-06 21:54:32,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:32,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:54:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:54:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:32,868 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:33,550 INFO L93 Difference]: Finished difference Result 306 states and 435 transitions. [2023-11-06 21:54:33,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:54:33,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-11-06 21:54:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:33,555 INFO L225 Difference]: With dead ends: 306 [2023-11-06 21:54:33,555 INFO L226 Difference]: Without dead ends: 192 [2023-11-06 21:54:33,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:54:33,561 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 247 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:33,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 516 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:54:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-06 21:54:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 126. [2023-11-06 21:54:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 112 states have internal predecessors, (156), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 21:54:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2023-11-06 21:54:33,586 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 116 [2023-11-06 21:54:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:33,587 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2023-11-06 21:54:33,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2023-11-06 21:54:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 21:54:33,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:33,590 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:33,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:54:33,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:33,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:33,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1862009829, now seen corresponding path program 1 times [2023-11-06 21:54:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923575956] [2023-11-06 21:54:33,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923575956] [2023-11-06 21:54:35,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923575956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:35,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:35,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 21:54:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494766438] [2023-11-06 21:54:35,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:35,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:54:35,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:35,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:54:35,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:54:35,167 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:35,958 INFO L93 Difference]: Finished difference Result 394 states and 566 transitions. [2023-11-06 21:54:35,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:35,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-11-06 21:54:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:35,962 INFO L225 Difference]: With dead ends: 394 [2023-11-06 21:54:35,962 INFO L226 Difference]: Without dead ends: 271 [2023-11-06 21:54:35,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:54:35,966 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 282 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:35,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 576 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:54:35,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-06 21:54:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 226. [2023-11-06 21:54:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.3919597989949748) internal successors, (277), 199 states have internal predecessors, (277), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:54:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 325 transitions. [2023-11-06 21:54:36,023 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 325 transitions. Word has length 116 [2023-11-06 21:54:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:36,026 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 325 transitions. [2023-11-06 21:54:36,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 325 transitions. [2023-11-06 21:54:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 21:54:36,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:36,029 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:36,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:54:36,030 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:36,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2070143913, now seen corresponding path program 1 times [2023-11-06 21:54:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:36,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909827526] [2023-11-06 21:54:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:36,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:37,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:37,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909827526] [2023-11-06 21:54:37,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909827526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:37,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:37,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:54:37,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533692632] [2023-11-06 21:54:37,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:37,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:37,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:37,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:37,218 INFO L87 Difference]: Start difference. First operand 226 states and 325 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:37,707 INFO L93 Difference]: Finished difference Result 453 states and 651 transitions. [2023-11-06 21:54:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:54:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-11-06 21:54:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:37,711 INFO L225 Difference]: With dead ends: 453 [2023-11-06 21:54:37,711 INFO L226 Difference]: Without dead ends: 230 [2023-11-06 21:54:37,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:37,715 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 104 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:37,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 486 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:54:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-06 21:54:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2023-11-06 21:54:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.3819095477386936) internal successors, (275), 199 states have internal predecessors, (275), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:54:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 323 transitions. [2023-11-06 21:54:37,747 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 323 transitions. Word has length 117 [2023-11-06 21:54:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:37,748 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 323 transitions. [2023-11-06 21:54:37,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 323 transitions. [2023-11-06 21:54:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 21:54:37,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:37,754 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:37,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:54:37,754 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:37,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash -463452726, now seen corresponding path program 1 times [2023-11-06 21:54:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360642789] [2023-11-06 21:54:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360642789] [2023-11-06 21:54:38,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360642789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:38,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:38,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:38,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859566745] [2023-11-06 21:54:38,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:38,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:54:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:38,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:54:38,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:38,550 INFO L87 Difference]: Start difference. First operand 226 states and 323 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:39,112 INFO L93 Difference]: Finished difference Result 570 states and 805 transitions. [2023-11-06 21:54:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:39,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2023-11-06 21:54:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:39,116 INFO L225 Difference]: With dead ends: 570 [2023-11-06 21:54:39,117 INFO L226 Difference]: Without dead ends: 347 [2023-11-06 21:54:39,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:54:39,121 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 343 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:39,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 338 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:54:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-11-06 21:54:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 314. [2023-11-06 21:54:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 281 states have (on average 1.3665480427046264) internal successors, (384), 283 states have internal predecessors, (384), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 21:54:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 440 transitions. [2023-11-06 21:54:39,185 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 440 transitions. Word has length 118 [2023-11-06 21:54:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:39,186 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 440 transitions. [2023-11-06 21:54:39,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 440 transitions. [2023-11-06 21:54:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 21:54:39,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:39,189 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:39,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:54:39,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:39,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1810249, now seen corresponding path program 1 times [2023-11-06 21:54:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:39,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958443244] [2023-11-06 21:54:39,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:39,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:39,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:39,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958443244] [2023-11-06 21:54:39,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958443244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:39,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:39,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:54:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966694244] [2023-11-06 21:54:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:39,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:54:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:54:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:39,781 INFO L87 Difference]: Start difference. First operand 314 states and 440 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:40,460 INFO L93 Difference]: Finished difference Result 879 states and 1228 transitions. [2023-11-06 21:54:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:54:40,462 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2023-11-06 21:54:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:40,469 INFO L225 Difference]: With dead ends: 879 [2023-11-06 21:54:40,469 INFO L226 Difference]: Without dead ends: 568 [2023-11-06 21:54:40,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:54:40,474 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 245 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:40,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 609 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:54:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2023-11-06 21:54:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 356. [2023-11-06 21:54:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 323 states have (on average 1.3498452012383901) internal successors, (436), 325 states have internal predecessors, (436), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 21:54:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 492 transitions. [2023-11-06 21:54:40,543 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 492 transitions. Word has length 118 [2023-11-06 21:54:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:40,544 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 492 transitions. [2023-11-06 21:54:40,545 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 492 transitions. [2023-11-06 21:54:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 21:54:40,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:40,548 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:40,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:54:40,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:40,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:40,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1145039086, now seen corresponding path program 1 times [2023-11-06 21:54:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:40,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952104639] [2023-11-06 21:54:40,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:40,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:41,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952104639] [2023-11-06 21:54:41,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952104639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:41,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:41,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:54:41,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980608614] [2023-11-06 21:54:41,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:41,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:41,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:41,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:41,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:41,131 INFO L87 Difference]: Start difference. First operand 356 states and 492 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:41,525 INFO L93 Difference]: Finished difference Result 574 states and 797 transitions. [2023-11-06 21:54:41,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:41,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-06 21:54:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:41,530 INFO L225 Difference]: With dead ends: 574 [2023-11-06 21:54:41,530 INFO L226 Difference]: Without dead ends: 392 [2023-11-06 21:54:41,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:41,532 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 130 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:41,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 378 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:54:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-06 21:54:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 360. [2023-11-06 21:54:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 327 states have (on average 1.345565749235474) internal successors, (440), 329 states have internal predecessors, (440), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 21:54:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 496 transitions. [2023-11-06 21:54:41,591 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 496 transitions. Word has length 119 [2023-11-06 21:54:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:41,592 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 496 transitions. [2023-11-06 21:54:41,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 496 transitions. [2023-11-06 21:54:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 21:54:41,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:41,596 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:41,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:54:41,597 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:41,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1290716798, now seen corresponding path program 1 times [2023-11-06 21:54:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:41,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941688084] [2023-11-06 21:54:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:43,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941688084] [2023-11-06 21:54:43,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941688084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:43,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:43,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 21:54:43,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115165435] [2023-11-06 21:54:43,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:43,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 21:54:43,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 21:54:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:54:43,972 INFO L87 Difference]: Start difference. First operand 360 states and 496 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:45,571 INFO L93 Difference]: Finished difference Result 816 states and 1119 transitions. [2023-11-06 21:54:45,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:45,573 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-06 21:54:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:45,577 INFO L225 Difference]: With dead ends: 816 [2023-11-06 21:54:45,577 INFO L226 Difference]: Without dead ends: 459 [2023-11-06 21:54:45,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:54:45,579 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 201 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:45,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 795 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 21:54:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-11-06 21:54:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 369. [2023-11-06 21:54:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 336 states have (on average 1.3392857142857142) internal successors, (450), 338 states have internal predecessors, (450), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 21:54:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 506 transitions. [2023-11-06 21:54:45,632 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 506 transitions. Word has length 119 [2023-11-06 21:54:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:45,633 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 506 transitions. [2023-11-06 21:54:45,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 506 transitions. [2023-11-06 21:54:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 21:54:45,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:45,636 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:45,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:54:45,637 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:45,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:45,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1800189888, now seen corresponding path program 1 times [2023-11-06 21:54:45,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:45,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380255804] [2023-11-06 21:54:45,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:45,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:47,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:47,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380255804] [2023-11-06 21:54:47,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380255804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:47,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:47,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 21:54:47,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065621016] [2023-11-06 21:54:47,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:47,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 21:54:47,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 21:54:47,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:54:47,900 INFO L87 Difference]: Start difference. First operand 369 states and 506 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:54:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:49,482 INFO L93 Difference]: Finished difference Result 772 states and 1057 transitions. [2023-11-06 21:54:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:54:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-11-06 21:54:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:49,486 INFO L225 Difference]: With dead ends: 772 [2023-11-06 21:54:49,486 INFO L226 Difference]: Without dead ends: 406 [2023-11-06 21:54:49,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:54:49,489 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 218 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:49,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 636 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 21:54:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2023-11-06 21:54:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 369. [2023-11-06 21:54:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 336 states have (on average 1.3363095238095237) internal successors, (449), 338 states have internal predecessors, (449), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 21:54:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 505 transitions. [2023-11-06 21:54:49,535 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 505 transitions. Word has length 119 [2023-11-06 21:54:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:49,536 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 505 transitions. [2023-11-06 21:54:49,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:54:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 505 transitions. [2023-11-06 21:54:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 21:54:49,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:49,539 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:49,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:54:49,539 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:49,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:49,540 INFO L85 PathProgramCache]: Analyzing trace with hash 5248446, now seen corresponding path program 1 times [2023-11-06 21:54:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:49,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023758242] [2023-11-06 21:54:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:50,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:50,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023758242] [2023-11-06 21:54:50,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023758242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:50,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:50,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:50,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096384681] [2023-11-06 21:54:50,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:50,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:54:50,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:50,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:54:50,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:50,122 INFO L87 Difference]: Start difference. First operand 369 states and 505 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:50,725 INFO L93 Difference]: Finished difference Result 837 states and 1141 transitions. [2023-11-06 21:54:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:50,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-06 21:54:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:50,738 INFO L225 Difference]: With dead ends: 837 [2023-11-06 21:54:50,739 INFO L226 Difference]: Without dead ends: 439 [2023-11-06 21:54:50,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:50,741 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 263 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:50,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 432 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:54:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-06 21:54:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 335. [2023-11-06 21:54:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 304 states have (on average 1.3223684210526316) internal successors, (402), 305 states have internal predecessors, (402), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 21:54:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 454 transitions. [2023-11-06 21:54:50,790 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 454 transitions. Word has length 119 [2023-11-06 21:54:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:50,791 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 454 transitions. [2023-11-06 21:54:50,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2023-11-06 21:54:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 21:54:50,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:50,793 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:50,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:54:50,794 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:50,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1369422809, now seen corresponding path program 1 times [2023-11-06 21:54:50,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120354664] [2023-11-06 21:54:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:51,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120354664] [2023-11-06 21:54:51,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120354664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:51,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962963600] [2023-11-06 21:54:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:51,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:54:51,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:51,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:54:51,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:51,429 INFO L87 Difference]: Start difference. First operand 335 states and 454 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:51,953 INFO L93 Difference]: Finished difference Result 651 states and 879 transitions. [2023-11-06 21:54:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-06 21:54:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:51,958 INFO L225 Difference]: With dead ends: 651 [2023-11-06 21:54:51,958 INFO L226 Difference]: Without dead ends: 443 [2023-11-06 21:54:51,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:51,960 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 335 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:51,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 312 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:54:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-11-06 21:54:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 272. [2023-11-06 21:54:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 243 states have internal predecessors, (317), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:54:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 365 transitions. [2023-11-06 21:54:52,005 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 365 transitions. Word has length 119 [2023-11-06 21:54:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:52,006 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 365 transitions. [2023-11-06 21:54:52,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2023-11-06 21:54:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 21:54:52,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:52,009 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:52,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:54:52,010 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:52,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1914427237, now seen corresponding path program 1 times [2023-11-06 21:54:52,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:52,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316738588] [2023-11-06 21:54:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:52,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316738588] [2023-11-06 21:54:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316738588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:52,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97817453] [2023-11-06 21:54:52,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:52,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:54:52,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:54:52,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:52,594 INFO L87 Difference]: Start difference. First operand 272 states and 365 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:53,065 INFO L93 Difference]: Finished difference Result 447 states and 600 transitions. [2023-11-06 21:54:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:53,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-06 21:54:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:53,069 INFO L225 Difference]: With dead ends: 447 [2023-11-06 21:54:53,069 INFO L226 Difference]: Without dead ends: 302 [2023-11-06 21:54:53,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:53,073 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 175 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:53,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 386 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:54:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-11-06 21:54:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 272. [2023-11-06 21:54:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 243 states have (on average 1.300411522633745) internal successors, (316), 243 states have internal predecessors, (316), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:54:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 364 transitions. [2023-11-06 21:54:53,111 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 364 transitions. Word has length 119 [2023-11-06 21:54:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:53,111 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 364 transitions. [2023-11-06 21:54:53,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 364 transitions. [2023-11-06 21:54:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 21:54:53,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:53,114 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:53,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 21:54:53,115 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:53,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:53,115 INFO L85 PathProgramCache]: Analyzing trace with hash -437944966, now seen corresponding path program 1 times [2023-11-06 21:54:53,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:53,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879107202] [2023-11-06 21:54:53,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:53,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:54,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:54,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879107202] [2023-11-06 21:54:54,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879107202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:54,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:54,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 21:54:54,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758691038] [2023-11-06 21:54:54,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:54,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:54:54,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:54:54,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:54:54,886 INFO L87 Difference]: Start difference. First operand 272 states and 364 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:55,996 INFO L93 Difference]: Finished difference Result 584 states and 779 transitions. [2023-11-06 21:54:55,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:54:55,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2023-11-06 21:54:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:56,000 INFO L225 Difference]: With dead ends: 584 [2023-11-06 21:54:56,000 INFO L226 Difference]: Without dead ends: 315 [2023-11-06 21:54:56,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-06 21:54:56,002 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 392 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:56,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 480 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:54:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-06 21:54:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 280. [2023-11-06 21:54:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 251 states have (on average 1.294820717131474) internal successors, (325), 251 states have internal predecessors, (325), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:54:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 373 transitions. [2023-11-06 21:54:56,043 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 373 transitions. Word has length 120 [2023-11-06 21:54:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:56,044 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 373 transitions. [2023-11-06 21:54:56,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:54:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 373 transitions. [2023-11-06 21:54:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 21:54:56,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:56,047 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:54:56,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 21:54:56,048 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:56,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:56,048 INFO L85 PathProgramCache]: Analyzing trace with hash 948258428, now seen corresponding path program 1 times [2023-11-06 21:54:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995535026] [2023-11-06 21:54:56,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:54:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:54:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:58,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995535026] [2023-11-06 21:54:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995535026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:58,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:58,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-06 21:54:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052630674] [2023-11-06 21:54:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:58,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 21:54:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:58,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 21:54:58,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-11-06 21:54:58,882 INFO L87 Difference]: Start difference. First operand 280 states and 373 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 21:55:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:00,934 INFO L93 Difference]: Finished difference Result 589 states and 784 transitions. [2023-11-06 21:55:00,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:55:00,934 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 120 [2023-11-06 21:55:00,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:00,937 INFO L225 Difference]: With dead ends: 589 [2023-11-06 21:55:00,937 INFO L226 Difference]: Without dead ends: 312 [2023-11-06 21:55:00,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2023-11-06 21:55:00,939 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 477 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:00,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 880 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 21:55:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-06 21:55:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 272. [2023-11-06 21:55:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 243 states have (on average 1.2962962962962963) internal successors, (315), 243 states have internal predecessors, (315), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:55:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 363 transitions. [2023-11-06 21:55:00,975 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 363 transitions. Word has length 120 [2023-11-06 21:55:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:00,976 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 363 transitions. [2023-11-06 21:55:00,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 21:55:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 363 transitions. [2023-11-06 21:55:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 21:55:00,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:00,979 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:00,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 21:55:00,979 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:00,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2103925053, now seen corresponding path program 1 times [2023-11-06 21:55:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:00,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434394106] [2023-11-06 21:55:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:00,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434394106] [2023-11-06 21:55:01,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434394106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:01,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:01,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 21:55:01,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285290058] [2023-11-06 21:55:01,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:01,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:55:01,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:01,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:55:01,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:55:01,536 INFO L87 Difference]: Start difference. First operand 272 states and 363 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:02,419 INFO L93 Difference]: Finished difference Result 724 states and 972 transitions. [2023-11-06 21:55:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 21:55:02,420 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-11-06 21:55:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:02,423 INFO L225 Difference]: With dead ends: 724 [2023-11-06 21:55:02,423 INFO L226 Difference]: Without dead ends: 455 [2023-11-06 21:55:02,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2023-11-06 21:55:02,425 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 390 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:02,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 750 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:55:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2023-11-06 21:55:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 298. [2023-11-06 21:55:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 269 states have (on average 1.2899628252788105) internal successors, (347), 269 states have internal predecessors, (347), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:55:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2023-11-06 21:55:02,458 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 121 [2023-11-06 21:55:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:02,459 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2023-11-06 21:55:02,459 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2023-11-06 21:55:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 21:55:02,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:02,462 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:02,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 21:55:02,463 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:02,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:02,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1885070335, now seen corresponding path program 1 times [2023-11-06 21:55:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:02,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726558438] [2023-11-06 21:55:02,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:02,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:02,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726558438] [2023-11-06 21:55:02,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726558438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:02,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:55:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780161556] [2023-11-06 21:55:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:02,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:55:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:02,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:55:02,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:55:02,814 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:03,400 INFO L93 Difference]: Finished difference Result 726 states and 967 transitions. [2023-11-06 21:55:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:55:03,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-11-06 21:55:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:03,404 INFO L225 Difference]: With dead ends: 726 [2023-11-06 21:55:03,405 INFO L226 Difference]: Without dead ends: 431 [2023-11-06 21:55:03,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:55:03,409 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 196 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:03,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 555 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:55:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-11-06 21:55:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 295. [2023-11-06 21:55:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 266 states have (on average 1.2857142857142858) internal successors, (342), 266 states have internal predecessors, (342), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:55:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 390 transitions. [2023-11-06 21:55:03,443 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 390 transitions. Word has length 121 [2023-11-06 21:55:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:03,443 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 390 transitions. [2023-11-06 21:55:03,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 390 transitions. [2023-11-06 21:55:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 21:55:03,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:03,447 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:03,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 21:55:03,447 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:03,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash 180170145, now seen corresponding path program 1 times [2023-11-06 21:55:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086477797] [2023-11-06 21:55:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:04,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086477797] [2023-11-06 21:55:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086477797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:55:04,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335904332] [2023-11-06 21:55:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:04,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:55:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:55:04,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:55:04,107 INFO L87 Difference]: Start difference. First operand 295 states and 390 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:04,619 INFO L93 Difference]: Finished difference Result 570 states and 752 transitions. [2023-11-06 21:55:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:55:04,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-11-06 21:55:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:04,625 INFO L225 Difference]: With dead ends: 570 [2023-11-06 21:55:04,625 INFO L226 Difference]: Without dead ends: 381 [2023-11-06 21:55:04,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:55:04,627 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 263 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:04,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 353 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:55:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-11-06 21:55:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 295. [2023-11-06 21:55:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 266 states have (on average 1.281954887218045) internal successors, (341), 266 states have internal predecessors, (341), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:55:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 389 transitions. [2023-11-06 21:55:04,669 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 389 transitions. Word has length 121 [2023-11-06 21:55:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:04,670 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 389 transitions. [2023-11-06 21:55:04,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 389 transitions. [2023-11-06 21:55:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 21:55:04,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:04,672 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:04,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 21:55:04,675 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:04,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash -402162992, now seen corresponding path program 1 times [2023-11-06 21:55:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624126698] [2023-11-06 21:55:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:06,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:07,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:07,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624126698] [2023-11-06 21:55:07,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624126698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:07,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:07,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 21:55:07,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651155052] [2023-11-06 21:55:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:07,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 21:55:07,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:07,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 21:55:07,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:55:07,013 INFO L87 Difference]: Start difference. First operand 295 states and 389 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:55:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:09,895 INFO L93 Difference]: Finished difference Result 643 states and 845 transitions. [2023-11-06 21:55:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:55:09,895 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2023-11-06 21:55:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:09,899 INFO L225 Difference]: With dead ends: 643 [2023-11-06 21:55:09,899 INFO L226 Difference]: Without dead ends: 481 [2023-11-06 21:55:09,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2023-11-06 21:55:09,901 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 349 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:09,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 926 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 21:55:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2023-11-06 21:55:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 325. [2023-11-06 21:55:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 294 states have (on average 1.2687074829931972) internal successors, (373), 294 states have internal predecessors, (373), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:55:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 421 transitions. [2023-11-06 21:55:09,948 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 421 transitions. Word has length 121 [2023-11-06 21:55:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:09,949 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 421 transitions. [2023-11-06 21:55:09,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:55:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 421 transitions. [2023-11-06 21:55:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 21:55:09,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:09,953 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:09,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 21:55:09,953 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:09,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash -340123378, now seen corresponding path program 1 times [2023-11-06 21:55:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:09,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071232989] [2023-11-06 21:55:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:09,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:10,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:10,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071232989] [2023-11-06 21:55:10,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071232989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:10,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:10,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:55:10,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350495501] [2023-11-06 21:55:10,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:10,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:55:10,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:10,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:55:10,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:55:10,972 INFO L87 Difference]: Start difference. First operand 325 states and 421 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:11,884 INFO L93 Difference]: Finished difference Result 598 states and 778 transitions. [2023-11-06 21:55:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:55:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-11-06 21:55:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:11,888 INFO L225 Difference]: With dead ends: 598 [2023-11-06 21:55:11,888 INFO L226 Difference]: Without dead ends: 410 [2023-11-06 21:55:11,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:55:11,889 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 197 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:11,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 447 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 21:55:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-11-06 21:55:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 303. [2023-11-06 21:55:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 272 states have (on average 1.2683823529411764) internal successors, (345), 272 states have internal predecessors, (345), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 21:55:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 393 transitions. [2023-11-06 21:55:11,929 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 393 transitions. Word has length 121 [2023-11-06 21:55:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:11,929 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 393 transitions. [2023-11-06 21:55:11,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 393 transitions. [2023-11-06 21:55:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 21:55:11,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:11,931 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:11,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 21:55:11,932 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:11,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1783189373, now seen corresponding path program 1 times [2023-11-06 21:55:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:11,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727223887] [2023-11-06 21:55:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:11,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:13,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:13,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727223887] [2023-11-06 21:55:13,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727223887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:13,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:13,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 21:55:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861210464] [2023-11-06 21:55:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 21:55:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 21:55:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:55:13,125 INFO L87 Difference]: Start difference. First operand 303 states and 393 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:14,540 INFO L93 Difference]: Finished difference Result 878 states and 1141 transitions. [2023-11-06 21:55:14,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 21:55:14,548 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 21:55:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:14,553 INFO L225 Difference]: With dead ends: 878 [2023-11-06 21:55:14,553 INFO L226 Difference]: Without dead ends: 578 [2023-11-06 21:55:14,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2023-11-06 21:55:14,556 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 396 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:14,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 794 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 21:55:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2023-11-06 21:55:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 388. [2023-11-06 21:55:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 342 states have (on average 1.263157894736842) internal successors, (432), 342 states have internal predecessors, (432), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 504 transitions. [2023-11-06 21:55:14,625 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 504 transitions. Word has length 122 [2023-11-06 21:55:14,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:14,627 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 504 transitions. [2023-11-06 21:55:14,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 504 transitions. [2023-11-06 21:55:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 21:55:14,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:14,631 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:14,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 21:55:14,632 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:14,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1082124795, now seen corresponding path program 1 times [2023-11-06 21:55:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:14,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933894428] [2023-11-06 21:55:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:15,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:15,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933894428] [2023-11-06 21:55:15,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933894428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:15,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:15,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 21:55:15,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933710325] [2023-11-06 21:55:15,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:15,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:55:15,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:15,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:55:15,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:55:15,870 INFO L87 Difference]: Start difference. First operand 388 states and 504 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:55:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:17,110 INFO L93 Difference]: Finished difference Result 895 states and 1164 transitions. [2023-11-06 21:55:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:55:17,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2023-11-06 21:55:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:17,115 INFO L225 Difference]: With dead ends: 895 [2023-11-06 21:55:17,115 INFO L226 Difference]: Without dead ends: 595 [2023-11-06 21:55:17,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:55:17,118 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 267 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:17,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 561 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:55:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-11-06 21:55:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 388. [2023-11-06 21:55:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 342 states have (on average 1.260233918128655) internal successors, (431), 342 states have internal predecessors, (431), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 503 transitions. [2023-11-06 21:55:17,187 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 503 transitions. Word has length 122 [2023-11-06 21:55:17,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:17,188 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 503 transitions. [2023-11-06 21:55:17,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:55:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 503 transitions. [2023-11-06 21:55:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 21:55:17,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:17,190 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:17,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 21:55:17,191 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:17,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1482554674, now seen corresponding path program 1 times [2023-11-06 21:55:17,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:17,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883556499] [2023-11-06 21:55:17,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:17,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:17,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883556499] [2023-11-06 21:55:17,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883556499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:17,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:17,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:55:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373143681] [2023-11-06 21:55:17,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:17,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:17,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:17,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:17,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:17,520 INFO L87 Difference]: Start difference. First operand 388 states and 503 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:17,826 INFO L93 Difference]: Finished difference Result 768 states and 1001 transitions. [2023-11-06 21:55:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:55:17,827 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 21:55:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:17,830 INFO L225 Difference]: With dead ends: 768 [2023-11-06 21:55:17,831 INFO L226 Difference]: Without dead ends: 468 [2023-11-06 21:55:17,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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 21:55:17,833 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 205 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:17,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 413 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:55:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-11-06 21:55:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 404. [2023-11-06 21:55:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 358 states have (on average 1.2541899441340782) internal successors, (449), 358 states have internal predecessors, (449), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 521 transitions. [2023-11-06 21:55:17,900 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 521 transitions. Word has length 122 [2023-11-06 21:55:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:17,901 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 521 transitions. [2023-11-06 21:55:17,902 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 521 transitions. [2023-11-06 21:55:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 21:55:17,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:17,904 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:17,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 21:55:17,904 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:17,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:17,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1081589499, now seen corresponding path program 1 times [2023-11-06 21:55:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:17,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629918552] [2023-11-06 21:55:17,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:17,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:18,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:18,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629918552] [2023-11-06 21:55:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629918552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:18,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:18,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 21:55:18,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404742934] [2023-11-06 21:55:18,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:18,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:55:18,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:19,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:55:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:55:19,000 INFO L87 Difference]: Start difference. First operand 404 states and 521 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:55:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:20,280 INFO L93 Difference]: Finished difference Result 982 states and 1269 transitions. [2023-11-06 21:55:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:55:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2023-11-06 21:55:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:20,285 INFO L225 Difference]: With dead ends: 982 [2023-11-06 21:55:20,286 INFO L226 Difference]: Without dead ends: 666 [2023-11-06 21:55:20,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-06 21:55:20,288 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 294 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:20,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 581 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:55:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-11-06 21:55:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 444. [2023-11-06 21:55:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 398 states have (on average 1.243718592964824) internal successors, (495), 398 states have internal predecessors, (495), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 567 transitions. [2023-11-06 21:55:20,396 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 567 transitions. Word has length 122 [2023-11-06 21:55:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:20,397 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 567 transitions. [2023-11-06 21:55:20,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:55:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 567 transitions. [2023-11-06 21:55:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 21:55:20,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:20,399 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:20,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 21:55:20,399 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:20,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash -380524921, now seen corresponding path program 1 times [2023-11-06 21:55:20,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55091414] [2023-11-06 21:55:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:21,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55091414] [2023-11-06 21:55:21,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55091414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:21,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:21,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 21:55:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284126218] [2023-11-06 21:55:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:21,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:55:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:21,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:55:21,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:55:21,609 INFO L87 Difference]: Start difference. First operand 444 states and 567 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:55:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:23,419 INFO L93 Difference]: Finished difference Result 982 states and 1268 transitions. [2023-11-06 21:55:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 21:55:23,420 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2023-11-06 21:55:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:23,425 INFO L225 Difference]: With dead ends: 982 [2023-11-06 21:55:23,425 INFO L226 Difference]: Without dead ends: 666 [2023-11-06 21:55:23,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2023-11-06 21:55:23,427 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 497 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:23,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 940 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 21:55:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-11-06 21:55:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 537. [2023-11-06 21:55:23,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 491 states have (on average 1.2362525458248472) internal successors, (607), 491 states have internal predecessors, (607), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 679 transitions. [2023-11-06 21:55:23,499 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 679 transitions. Word has length 122 [2023-11-06 21:55:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:23,500 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 679 transitions. [2023-11-06 21:55:23,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:55:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 679 transitions. [2023-11-06 21:55:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 21:55:23,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:23,502 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:23,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 21:55:23,503 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:23,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1936479698, now seen corresponding path program 1 times [2023-11-06 21:55:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:23,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374979677] [2023-11-06 21:55:23,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:27,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:27,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374979677] [2023-11-06 21:55:27,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374979677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:27,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:27,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-06 21:55:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978116275] [2023-11-06 21:55:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:27,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 21:55:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:27,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 21:55:27,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:55:27,101 INFO L87 Difference]: Start difference. First operand 537 states and 679 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-06 21:55:36,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 21:55:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:40,591 INFO L93 Difference]: Finished difference Result 1007 states and 1275 transitions. [2023-11-06 21:55:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 21:55:40,592 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2023-11-06 21:55:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:40,604 INFO L225 Difference]: With dead ends: 1007 [2023-11-06 21:55:40,605 INFO L226 Difference]: Without dead ends: 767 [2023-11-06 21:55:40,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2023-11-06 21:55:40,607 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 407 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:40,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 932 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-11-06 21:55:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2023-11-06 21:55:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 555. [2023-11-06 21:55:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 509 states have (on average 1.2357563850687623) internal successors, (629), 509 states have internal predecessors, (629), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 701 transitions. [2023-11-06 21:55:40,685 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 701 transitions. Word has length 122 [2023-11-06 21:55:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:40,686 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 701 transitions. [2023-11-06 21:55:40,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-06 21:55:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 701 transitions. [2023-11-06 21:55:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 21:55:40,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:40,688 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:40,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 21:55:40,689 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:40,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:40,689 INFO L85 PathProgramCache]: Analyzing trace with hash -13251664, now seen corresponding path program 1 times [2023-11-06 21:55:40,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:40,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420100791] [2023-11-06 21:55:40,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:40,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:41,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:41,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420100791] [2023-11-06 21:55:41,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420100791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:41,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:55:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98743649] [2023-11-06 21:55:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:41,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:55:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:41,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:55:41,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:55:41,526 INFO L87 Difference]: Start difference. First operand 555 states and 701 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:42,213 INFO L93 Difference]: Finished difference Result 865 states and 1091 transitions. [2023-11-06 21:55:42,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:55:42,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 21:55:42,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:42,218 INFO L225 Difference]: With dead ends: 865 [2023-11-06 21:55:42,218 INFO L226 Difference]: Without dead ends: 625 [2023-11-06 21:55:42,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:55:42,220 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 234 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:42,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 332 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:55:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-11-06 21:55:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 522. [2023-11-06 21:55:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 476 states have (on average 1.2247899159663866) internal successors, (583), 476 states have internal predecessors, (583), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 655 transitions. [2023-11-06 21:55:42,290 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 655 transitions. Word has length 122 [2023-11-06 21:55:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:42,291 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 655 transitions. [2023-11-06 21:55:42,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 655 transitions. [2023-11-06 21:55:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 21:55:42,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:42,293 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:42,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 21:55:42,293 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:42,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:42,294 INFO L85 PathProgramCache]: Analyzing trace with hash 865398606, now seen corresponding path program 1 times [2023-11-06 21:55:42,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:42,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800181568] [2023-11-06 21:55:42,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:42,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:42,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:42,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800181568] [2023-11-06 21:55:42,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800181568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:42,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:42,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:55:42,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343020871] [2023-11-06 21:55:42,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:42,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:55:42,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:43,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:55:43,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:55:43,002 INFO L87 Difference]: Start difference. First operand 522 states and 655 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 21:55:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:43,574 INFO L93 Difference]: Finished difference Result 896 states and 1127 transitions. [2023-11-06 21:55:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:55:43,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2023-11-06 21:55:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:43,579 INFO L225 Difference]: With dead ends: 896 [2023-11-06 21:55:43,579 INFO L226 Difference]: Without dead ends: 498 [2023-11-06 21:55:43,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:55:43,581 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 129 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:43,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 300 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:55:43,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-11-06 21:55:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 494. [2023-11-06 21:55:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 448 states have (on average 1.2232142857142858) internal successors, (548), 448 states have internal predecessors, (548), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 620 transitions. [2023-11-06 21:55:43,637 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 620 transitions. Word has length 122 [2023-11-06 21:55:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:43,638 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 620 transitions. [2023-11-06 21:55:43,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 21:55:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 620 transitions. [2023-11-06 21:55:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 21:55:43,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:43,640 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:43,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 21:55:43,640 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:43,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash -331256907, now seen corresponding path program 1 times [2023-11-06 21:55:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354845957] [2023-11-06 21:55:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:43,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:43,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354845957] [2023-11-06 21:55:43,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354845957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:43,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:43,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:55:43,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308289469] [2023-11-06 21:55:43,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:43,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:43,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:43,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:43,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:43,849 INFO L87 Difference]: Start difference. First operand 494 states and 620 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:43,946 INFO L93 Difference]: Finished difference Result 884 states and 1114 transitions. [2023-11-06 21:55:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:55:43,947 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2023-11-06 21:55:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:43,951 INFO L225 Difference]: With dead ends: 884 [2023-11-06 21:55:43,951 INFO L226 Difference]: Without dead ends: 514 [2023-11-06 21:55:43,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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 21:55:43,954 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 45 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:43,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 571 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:55:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-11-06 21:55:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2023-11-06 21:55:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 454 states have (on average 1.2202643171806167) internal successors, (554), 454 states have internal predecessors, (554), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 626 transitions. [2023-11-06 21:55:44,020 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 626 transitions. Word has length 124 [2023-11-06 21:55:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:44,020 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 626 transitions. [2023-11-06 21:55:44,021 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 626 transitions. [2023-11-06 21:55:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 21:55:44,022 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:44,022 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:44,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 21:55:44,023 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:44,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1233944631, now seen corresponding path program 1 times [2023-11-06 21:55:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721927340] [2023-11-06 21:55:44,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:44,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:44,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:44,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721927340] [2023-11-06 21:55:44,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721927340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:44,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:44,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:55:44,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870492666] [2023-11-06 21:55:44,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:44,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:44,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:44,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:44,342 INFO L87 Difference]: Start difference. First operand 500 states and 626 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:44,585 INFO L93 Difference]: Finished difference Result 794 states and 993 transitions. [2023-11-06 21:55:44,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:55:44,586 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2023-11-06 21:55:44,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:44,590 INFO L225 Difference]: With dead ends: 794 [2023-11-06 21:55:44,590 INFO L226 Difference]: Without dead ends: 566 [2023-11-06 21:55:44,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:55:44,592 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 142 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:44,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 439 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:55:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-11-06 21:55:44,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 500. [2023-11-06 21:55:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 454 states have (on average 1.2180616740088106) internal successors, (553), 454 states have internal predecessors, (553), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 625 transitions. [2023-11-06 21:55:44,660 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 625 transitions. Word has length 124 [2023-11-06 21:55:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:44,661 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 625 transitions. [2023-11-06 21:55:44,661 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 625 transitions. [2023-11-06 21:55:44,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 21:55:44,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:44,663 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:44,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 21:55:44,664 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:44,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:44,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1534579330, now seen corresponding path program 1 times [2023-11-06 21:55:44,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:44,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060179841] [2023-11-06 21:55:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:44,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:45,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:45,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060179841] [2023-11-06 21:55:45,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060179841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:45,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:45,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 21:55:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071351695] [2023-11-06 21:55:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:45,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 21:55:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 21:55:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:55:45,878 INFO L87 Difference]: Start difference. First operand 500 states and 625 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:55:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:47,176 INFO L93 Difference]: Finished difference Result 753 states and 940 transitions. [2023-11-06 21:55:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:55:47,177 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2023-11-06 21:55:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:47,181 INFO L225 Difference]: With dead ends: 753 [2023-11-06 21:55:47,181 INFO L226 Difference]: Without dead ends: 525 [2023-11-06 21:55:47,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2023-11-06 21:55:47,183 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 330 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:47,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 785 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 21:55:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-11-06 21:55:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 500. [2023-11-06 21:55:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 454 states have (on average 1.2180616740088106) internal successors, (553), 454 states have internal predecessors, (553), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 625 transitions. [2023-11-06 21:55:47,244 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 625 transitions. Word has length 124 [2023-11-06 21:55:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:47,245 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 625 transitions. [2023-11-06 21:55:47,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 21:55:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 625 transitions. [2023-11-06 21:55:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 21:55:47,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:47,247 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:47,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-06 21:55:47,247 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:47,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash 114706074, now seen corresponding path program 1 times [2023-11-06 21:55:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016983264] [2023-11-06 21:55:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:47,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:47,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016983264] [2023-11-06 21:55:47,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016983264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:47,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:47,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:55:47,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379109720] [2023-11-06 21:55:47,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:47,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:47,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:47,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:47,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:47,552 INFO L87 Difference]: Start difference. First operand 500 states and 625 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:47,805 INFO L93 Difference]: Finished difference Result 925 states and 1159 transitions. [2023-11-06 21:55:47,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:55:47,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2023-11-06 21:55:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:47,810 INFO L225 Difference]: With dead ends: 925 [2023-11-06 21:55:47,810 INFO L226 Difference]: Without dead ends: 549 [2023-11-06 21:55:47,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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 21:55:47,812 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 120 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:47,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 461 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:55:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-11-06 21:55:47,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 501. [2023-11-06 21:55:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 455 states have (on average 1.213186813186813) internal successors, (552), 455 states have internal predecessors, (552), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 624 transitions. [2023-11-06 21:55:47,878 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 624 transitions. Word has length 126 [2023-11-06 21:55:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:47,878 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 624 transitions. [2023-11-06 21:55:47,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 624 transitions. [2023-11-06 21:55:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-06 21:55:47,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:47,880 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:47,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-06 21:55:47,881 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:47,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1420167933, now seen corresponding path program 1 times [2023-11-06 21:55:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:47,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150036496] [2023-11-06 21:55:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:47,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:55:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:48,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:48,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:48,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:48,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:48,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 21:55:48,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:48,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150036496] [2023-11-06 21:55:48,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150036496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:48,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:48,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:55:48,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833682115] [2023-11-06 21:55:48,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:48,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:55:48,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:48,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:55:48,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:55:48,014 INFO L87 Difference]: Start difference. First operand 501 states and 624 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:48,067 INFO L93 Difference]: Finished difference Result 876 states and 1090 transitions. [2023-11-06 21:55:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:55:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2023-11-06 21:55:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:48,071 INFO L225 Difference]: With dead ends: 876 [2023-11-06 21:55:48,072 INFO L226 Difference]: Without dead ends: 499 [2023-11-06 21:55:48,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 21:55:48,073 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 5 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:48,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 286 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:55:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2023-11-06 21:55:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2023-11-06 21:55:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 451 states have (on average 1.206208425720621) internal successors, (544), 451 states have internal predecessors, (544), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 21:55:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 616 transitions. [2023-11-06 21:55:48,135 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 616 transitions. Word has length 128 [2023-11-06 21:55:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:48,136 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 616 transitions. [2023-11-06 21:55:48,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 21:55:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 616 transitions. [2023-11-06 21:55:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-06 21:55:48,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:48,138 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:55:48,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-06 21:55:48,138 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:48,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2100812594, now seen corresponding path program 1 times [2023-11-06 21:55:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:48,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001134423] [2023-11-06 21:55:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:48,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:55:48,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:55:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:55:48,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:55:48,515 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:55:48,516 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:55:48,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-06 21:55:48,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:48,530 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:55:48,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:55:48 BoogieIcfgContainer [2023-11-06 21:55:48,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:55:48,720 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:55:48,720 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:55:48,721 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:55:48,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:28" (3/4) ... [2023-11-06 21:55:48,724 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:55:48,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:55:48,726 INFO L158 Benchmark]: Toolchain (without parser) took 81938.68ms. Allocated memory was 153.1MB in the beginning and 559.9MB in the end (delta: 406.8MB). Free memory was 122.6MB in the beginning and 277.4MB in the end (delta: -154.8MB). Peak memory consumption was 253.0MB. Max. memory is 16.1GB. [2023-11-06 21:55:48,728 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 109.1MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:55:48,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.59ms. Allocated memory is still 153.1MB. Free memory was 122.2MB in the beginning and 108.4MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 21:55:48,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.46ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 104.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:55:48,736 INFO L158 Benchmark]: Boogie Preprocessor took 81.70ms. Allocated memory is still 153.1MB. Free memory was 104.7MB in the beginning and 101.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:55:48,737 INFO L158 Benchmark]: RCFGBuilder took 1121.77ms. Allocated memory is still 153.1MB. Free memory was 101.4MB in the beginning and 119.3MB in the end (delta: -17.9MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2023-11-06 21:55:48,738 INFO L158 Benchmark]: TraceAbstraction took 80232.07ms. Allocated memory was 153.1MB in the beginning and 559.9MB in the end (delta: 406.8MB). Free memory was 118.6MB in the beginning and 277.4MB in the end (delta: -158.9MB). Peak memory consumption was 248.7MB. Max. memory is 16.1GB. [2023-11-06 21:55:48,741 INFO L158 Benchmark]: Witness Printer took 4.85ms. Allocated memory is still 559.9MB. Free memory is still 277.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:55:48,742 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.32ms. Allocated memory is still 109.1MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.59ms. Allocated memory is still 153.1MB. Free memory was 122.2MB in the beginning and 108.4MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.46ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 104.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.70ms. Allocated memory is still 153.1MB. Free memory was 104.7MB in the beginning and 101.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1121.77ms. Allocated memory is still 153.1MB. Free memory was 101.4MB in the beginning and 119.3MB in the end (delta: -17.9MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 80232.07ms. Allocated memory was 153.1MB in the beginning and 559.9MB in the end (delta: 406.8MB). Free memory was 118.6MB in the beginning and 277.4MB in the end (delta: -158.9MB). Peak memory consumption was 248.7MB. Max. memory is 16.1GB. * Witness Printer took 4.85ms. Allocated memory is still 559.9MB. Free memory is still 277.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -10 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -10; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] EXPR signed_long_int_Array_0[0] [L91] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=257, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[0]=257, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] 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, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] double_Array_0[0] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=1885310871, double_Array_0[0]=1885310871, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [(double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F=1, double_Array_0[0]=1885310871, double_Array_0[0]=1885310871, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [(double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F=1, double_Array_0[0]=1885310871, double_Array_0[0]=1885310871, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] double_Array_0[1] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1]=1885310872, double_Array_0[1]=1885310872, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [(double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F=1, double_Array_0[1]=1885310872, double_Array_0[1]=1885310872, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [(double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F=1, double_Array_0[1]=1885310872, double_Array_0[1]=1885310872, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] double_Array_0[3] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[3] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L80] EXPR double_Array_0[3] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[3]=1885310864, double_Array_0[3]=1885310864, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [(double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F=1, double_Array_0[3]=1885310864, double_Array_0[3]=1885310864, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [(double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F=1, double_Array_0[3]=1885310864, double_Array_0[3]=1885310864, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] double_Array_0[4] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[4] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L82] EXPR double_Array_0[4] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[4]=1885310869, double_Array_0[4]=1885310869, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [(double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F=1, double_Array_0[4]=1885310869, double_Array_0[4]=1885310869, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [(double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )=1, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F=1, double_Array_0[4]=1885310869, double_Array_0[4]=1885310869, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[0]=9, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[0]=9, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[0]=9, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[0]=9, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649] [L88] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649] [L102] RET updateVariables() [L103] CALL step() [L41] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L44] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649] [L44] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) VAL [((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649] [L44] unsigned_long_int_Array_0[1] = ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))) [L46] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L46] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L49] EXPR BOOL_unsigned_char_Array_0[1] [L49] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[1]; [L50] EXPR signed_long_int_Array_0[0] [L50] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L51] EXPR signed_long_int_Array_0[0] [L51] EXPR signed_long_int_Array_0[0] [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, stepLocal_0=-10, stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L51] COND TRUE stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L52] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[1]=-10] [L52] COND FALSE !(stepLocal_0 < unsigned_long_int_Array_0[1]) [L57] signed_char_Array_0[1] = 2 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L62] EXPR signed_char_Array_0[1] [L62] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L62] COND TRUE signed_char_Array_0[1] >= signed_char_Array_0[1] [L63] EXPR double_Array_0[0] [L63] EXPR double_Array_0[1] [L63] EXPR double_Array_0[3] [L63] EXPR double_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=1885310871, double_Array_0[1]=1885310872, double_Array_0[3]=1885310864, double_Array_0[4]=1885310869, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L63] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) [L63] EXPR double_Array_0[1] [L63] EXPR double_Array_0[3] [L63] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, double_Array_0[0]=1885310871, double_Array_0[1]=1885310872, double_Array_0[1]=1885310872, double_Array_0[3]=1885310864, double_Array_0[3]=1885310864, double_Array_0[4]=1885310869, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L63] double_Array_0[2] = (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR BOOL_unsigned_char_Array_0[1] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}] [L94] EXPR (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[1]=-10] [L94] EXPR (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2)) [L94] EXPR signed_char_Array_0[1] [L94] EXPR (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2)) VAL [(signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[1]=-10] [L94] EXPR (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [(BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[1]=-10] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) [L94] EXPR BOOL_unsigned_char_Array_0[1] VAL [((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[1]=-10] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))) [L94] EXPR unsigned_long_int_Array_0[1] [L94] EXPR unsigned_long_int_Array_0[0] VAL [((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) VAL [((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))) VAL [((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))=1, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) VAL [((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))=1, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) [L94] EXPR BOOL_unsigned_char_Array_0[1] VAL [(((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)=1, ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))=1, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1 VAL [(((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)=1, ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1=1, BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))=1, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) VAL [(((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)=1, ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1=1, BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))=1, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) [L94] EXPR signed_char_Array_0[1] [L94] EXPR signed_char_Array_0[1] VAL [((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))))=1, (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)=1, ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1=1, BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))=1, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) [L94] EXPR double_Array_0[2] [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[1] [L94] EXPR double_Array_0[3] [L94] EXPR double_Array_0[4] VAL [((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))))=1, (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)=1, ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1=1, BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))=1, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, double_Array_0[0]=1885310871, double_Array_0[1]=1885310872, double_Array_0[2]=1885310873, double_Array_0[3]=1885310864, double_Array_0[4]=1885310869, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) [L94] EXPR double_Array_0[4] [L94] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) VAL [((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))))=1, (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)=1, (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])=1885310869, ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1=1, BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))=1, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, double_Array_0[0]=1885310871, double_Array_0[1]=1885310872, double_Array_0[2]=1885310873, double_Array_0[3]=1885310864, double_Array_0[4]=1885310869, double_Array_0[4]=1885310869, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) VAL [((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))))=1, (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)=1, (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])=1885310869, ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))=0, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1=1, BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))=1, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, double_Array_0[0]=1885310871, double_Array_0[1]=1885310872, double_Array_0[2]=1885310873, double_Array_0[3]=1885310864, double_Array_0[4]=1885310869, double_Array_0[4]=1885310869, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) VAL [((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))))=0, (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)=1, (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])=1885310869, ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))=1, ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])=-10, (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))=1, (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))=0, (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))=1, BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1=1, BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))=1, BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])=1, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, BOOL_unsigned_char_Array_0[1]=-256, double_Array_0={5:0}, double_Array_0[0]=1885310871, double_Array_0[1]=1885310872, double_Array_0[2]=1885310873, double_Array_0[3]=1885310864, double_Array_0[4]=1885310869, double_Array_0[4]=1885310869, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_char_Array_0[1]=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, signed_long_int_Array_0[0]=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0[0]=-2147483649, unsigned_long_int_Array_0[1]=-10, unsigned_long_int_Array_0[1]=-10] [L94-L95] return ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.0s, OverallIterations: 36, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 41.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8215 SdHoareTripleChecker+Valid, 27.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8209 mSDsluCounter, 18455 SdHoareTripleChecker+Invalid, 24.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14051 mSDsCounter, 434 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18261 IncrementalHoareTripleChecker+Invalid, 18695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 434 mSolverCounterUnsat, 4404 mSDtfsCounter, 18261 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1361 GetRequests, 948 SyntacticMatches, 41 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=555occurred in iteration=28, InterpolantAutomatonStates: 306, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 2906 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 4334 NumberOfCodeBlocks, 4334 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4171 ConstructedInterpolants, 0 QuantifiedInterpolants, 35776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 9240/9240 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 21:55:48,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/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_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/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_0d39fc7a-b489-46b2-a729-422538d0cc43/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 af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:55:51,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:55:52,104 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 21:55:52,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:55:52,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:55:52,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:55:52,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:55:52,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:55:52,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:55:52,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:55:52,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:55:52,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:55:52,184 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:55:52,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:55:52,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:55:52,188 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:55:52,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:55:52,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:55:52,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:55:52,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:55:52,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:55:52,192 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:55:52,192 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:55:52,193 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:55:52,193 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:55:52,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:55:52,194 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:55:52,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:55:52,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:55:52,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:55:52,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:55:52,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:55:52,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:55:52,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:55:52,199 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:55:52,199 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:55:52,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:55:52,200 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:55:52,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:55:52,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:55:52,202 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:55:52,202 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:55:52,203 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_0d39fc7a-b489-46b2-a729-422538d0cc43/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_0d39fc7a-b489-46b2-a729-422538d0cc43/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 -> af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a [2023-11-06 21:55:52,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:55:52,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:55:52,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:55:52,713 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:55:52,714 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:55:52,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-11-06 21:55:56,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:55:56,771 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:55:56,772 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-11-06 21:55:56,782 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/data/5621dd213/8956dd24e2794c7eaa89d7609b41a75b/FLAG7497eaceb [2023-11-06 21:55:56,799 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/data/5621dd213/8956dd24e2794c7eaa89d7609b41a75b [2023-11-06 21:55:56,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:55:56,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:55:56,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:55:56,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:55:56,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:55:56,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:55:56" (1/1) ... [2023-11-06 21:55:56,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5518d664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:56, skipping insertion in model container [2023-11-06 21:55:56,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:55:56" (1/1) ... [2023-11-06 21:55:56,849 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:55:57,101 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_0d39fc7a-b489-46b2-a729-422538d0cc43/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2023-11-06 21:55:57,228 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:55:57,254 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:55:57,278 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_0d39fc7a-b489-46b2-a729-422538d0cc43/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2023-11-06 21:55:57,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:55:57,414 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:55:57,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57 WrapperNode [2023-11-06 21:55:57,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:55:57,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:55:57,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:55:57,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:55:57,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,545 INFO L138 Inliner]: procedures = 33, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2023-11-06 21:55:57,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:55:57,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:55:57,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:55:57,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:55:57,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:55:57,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:55:57,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:55:57,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:55:57,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:55:57,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:57,804 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:55:57,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:55:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:55:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 21:55:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 21:55:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 21:55:57,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:55:57,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 21:55:57,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 21:55:57,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 21:55:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:55:57,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:55:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:55:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:55:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 21:55:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 21:55:58,004 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:55:58,007 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:56:00,491 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:56:00,506 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:56:00,506 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:56:00,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:56:00 BoogieIcfgContainer [2023-11-06 21:56:00,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:56:00,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:56:00,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:56:00,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:56:00,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:55:56" (1/3) ... [2023-11-06 21:56:00,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a33580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:56:00, skipping insertion in model container [2023-11-06 21:56:00,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (2/3) ... [2023-11-06 21:56:00,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a33580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:56:00, skipping insertion in model container [2023-11-06 21:56:00,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:56:00" (3/3) ... [2023-11-06 21:56:00,529 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2023-11-06 21:56:00,555 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:56:00,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:56:00,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:56:00,641 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;@2fdaad95, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:56:00,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:56:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 21:56:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 21:56:00,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:00,665 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:56:00,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:56:00,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2045303348, now seen corresponding path program 1 times [2023-11-06 21:56:00,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:00,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815233306] [2023-11-06 21:56:00,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:00,694 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 21:56:00,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:00,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/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 21:56:00,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/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 21:56:01,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/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 21:56:01,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/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 21:56:01,335 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_0d39fc7a-b489-46b2-a729-422538d0cc43/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_0d39fc7a-b489-46b2-a729-422538d0cc43/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 21:56:01,343 INFO L158 Benchmark]: Toolchain (without parser) took 4537.76ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 61.3MB in the beginning and 75.8MB in the end (delta: -14.5MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2023-11-06 21:56:01,344 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 86.0MB. Free memory was 61.4MB in the beginning and 61.3MB in the end (delta: 153.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:56:01,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.28ms. Allocated memory is still 86.0MB. Free memory was 61.3MB in the beginning and 46.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 21:56:01,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 137.30ms. Allocated memory is still 86.0MB. Free memory was 46.0MB in the beginning and 42.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:56:01,350 INFO L158 Benchmark]: Boogie Preprocessor took 171.86ms. Allocated memory is still 86.0MB. Free memory was 42.2MB in the beginning and 61.4MB in the end (delta: -19.2MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2023-11-06 21:56:01,356 INFO L158 Benchmark]: RCFGBuilder took 2784.06ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 61.1MB in the beginning and 69.5MB in the end (delta: -8.4MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2023-11-06 21:56:01,359 INFO L158 Benchmark]: TraceAbstraction took 825.18ms. Allocated memory is still 107.0MB. Free memory was 68.5MB in the beginning and 75.8MB in the end (delta: -7.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:56:01,367 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.35ms. Allocated memory is still 86.0MB. Free memory was 61.4MB in the beginning and 61.3MB in the end (delta: 153.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.28ms. Allocated memory is still 86.0MB. Free memory was 61.3MB in the beginning and 46.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 137.30ms. Allocated memory is still 86.0MB. Free memory was 46.0MB in the beginning and 42.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 171.86ms. Allocated memory is still 86.0MB. Free memory was 42.2MB in the beginning and 61.4MB in the end (delta: -19.2MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2784.06ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 61.1MB in the beginning and 69.5MB in the end (delta: -8.4MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * TraceAbstraction took 825.18ms. Allocated memory is still 107.0MB. Free memory was 68.5MB in the beginning and 75.8MB in the end (delta: -7.3MB). 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_0d39fc7a-b489-46b2-a729-422538d0cc43/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_0d39fc7a-b489-46b2-a729-422538d0cc43/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 21:56:01,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d39fc7a-b489-46b2-a729-422538d0cc43/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_0d39fc7a-b489-46b2-a729-422538d0cc43/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.