./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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 a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:12:45,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:12:45,203 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:12:45,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:12:45,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:12:45,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:12:45,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:12:45,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:12:45,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:12:45,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:12:45,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:12:45,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:12:45,242 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:12:45,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:12:45,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:12:45,244 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:12:45,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:12:45,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:12:45,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:12:45,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:12:45,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:12:45,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:12:45,248 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:12:45,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:12:45,250 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:12:45,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:12:45,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:12:45,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:12:45,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:12:45,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:12:45,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:12:45,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:12:45,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:12:45,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:12:45,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:12:45,257 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:12:45,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:12:45,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:12:45,258 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:12:45,258 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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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 -> a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 [2023-11-06 22:12:45,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:12:45,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:12:45,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:12:45,585 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:12:45,585 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:12:45,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i [2023-11-06 22:12:48,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:12:48,966 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:12:48,966 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i [2023-11-06 22:12:48,978 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/data/7464b6383/41e1ae5284a04c27b5e013ac2922a8f5/FLAGfe0909377 [2023-11-06 22:12:49,000 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/data/7464b6383/41e1ae5284a04c27b5e013ac2922a8f5 [2023-11-06 22:12:49,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:12:49,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:12:49,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:12:49,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:12:49,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:12:49,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8647d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49, skipping insertion in model container [2023-11-06 22:12:49,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,066 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:12:49,239 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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i[916,929] [2023-11-06 22:12:49,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:12:49,320 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:12:49,333 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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i[916,929] [2023-11-06 22:12:49,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:12:49,452 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:12:49,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49 WrapperNode [2023-11-06 22:12:49,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:12:49,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:12:49,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:12:49,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:12:49,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,537 INFO L138 Inliner]: procedures = 29, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2023-11-06 22:12:49,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:12:49,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:12:49,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:12:49,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:12:49,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:12:49,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:12:49,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:12:49,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:12:49,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (1/1) ... [2023-11-06 22:12:49,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:12:49,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:49,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:12:49,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:12:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:12:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:12:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:12:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:12:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:12:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:12:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:12:49,707 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:12:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:12:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:12:49,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:12:49,862 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:12:49,864 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:12:50,515 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:12:50,527 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:12:50,527 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:12:50,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:50 BoogieIcfgContainer [2023-11-06 22:12:50,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:12:50,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:12:50,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:12:50,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:12:50,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:12:49" (1/3) ... [2023-11-06 22:12:50,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db361b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:50, skipping insertion in model container [2023-11-06 22:12:50,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:49" (2/3) ... [2023-11-06 22:12:50,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db361b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:50, skipping insertion in model container [2023-11-06 22:12:50,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:50" (3/3) ... [2023-11-06 22:12:50,543 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-53.i [2023-11-06 22:12:50,563 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:12:50,563 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:12:50,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:12:50,620 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;@6badb473, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:12:50,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:12:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:12:50,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:12:50,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:50,650 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:50,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:50,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:50,655 INFO L85 PathProgramCache]: Analyzing trace with hash 528541446, now seen corresponding path program 1 times [2023-11-06 22:12:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:50,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641679296] [2023-11-06 22:12:50,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:12:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:12:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:12:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:12:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:12:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:12:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:12:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:12:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:12:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:12:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:12:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:12:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:12:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:12:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:12:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:12:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:12:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:12:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:12:51,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:51,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641679296] [2023-11-06 22:12:51,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641679296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:51,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:51,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:12:51,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741905914] [2023-11-06 22:12:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:51,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:12:51,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:51,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:12:51,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:12:51,300 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:12:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:51,356 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2023-11-06 22:12:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:12:51,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2023-11-06 22:12:51,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:51,367 INFO L225 Difference]: With dead ends: 217 [2023-11-06 22:12:51,367 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:12:51,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:12:51,375 INFO L413 NwaCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:51,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:12:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:12:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-06 22:12:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:12:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2023-11-06 22:12:51,446 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2023-11-06 22:12:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:51,446 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2023-11-06 22:12:51,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:12:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2023-11-06 22:12:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:12:51,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:51,455 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:51,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:12:51,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:51,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1839681894, now seen corresponding path program 1 times [2023-11-06 22:12:51,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:51,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924894256] [2023-11-06 22:12:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:12:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:12:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:12:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:12:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:12:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:12:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:12:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:12:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:12:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:12:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:12:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:12:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:12:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:12:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:12:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:12:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:12:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:12:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:12:52,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924894256] [2023-11-06 22:12:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924894256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:52,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:52,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:12:52,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259196487] [2023-11-06 22:12:52,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:52,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:52,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:52,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:52,369 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:12:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:52,423 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2023-11-06 22:12:52,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:52,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-11-06 22:12:52,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:52,433 INFO L225 Difference]: With dead ends: 213 [2023-11-06 22:12:52,434 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:12:52,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:52,439 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 302 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 22:12:52,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 302 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:12:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:12:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-06 22:12:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:12:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2023-11-06 22:12:52,463 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2023-11-06 22:12:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:52,466 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2023-11-06 22:12:52,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:12:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2023-11-06 22:12:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:12:52,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:52,470 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:52,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:12:52,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:52,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:52,471 INFO L85 PathProgramCache]: Analyzing trace with hash 818613540, now seen corresponding path program 1 times [2023-11-06 22:12:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:52,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978537432] [2023-11-06 22:12:52,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:52,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:12:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:12:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:12:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:12:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:12:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:12:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:12:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:12:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:12:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:12:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:12:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:12:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:12:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:12:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:12:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:12:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:12:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:12:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:12:55,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:55,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978537432] [2023-11-06 22:12:55,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978537432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:55,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:55,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:12:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951528635] [2023-11-06 22:12:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:55,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:12:55,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:55,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:12:55,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:12:55,416 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:12:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:12:56,040 INFO L93 Difference]: Finished difference Result 245 states and 349 transitions. [2023-11-06 22:12:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:12:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2023-11-06 22:12:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:12:56,047 INFO L225 Difference]: With dead ends: 245 [2023-11-06 22:12:56,047 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 22:12:56,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:12:56,054 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 183 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:12:56,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 428 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:12:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 22:12:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2023-11-06 22:12:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:12:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2023-11-06 22:12:56,091 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 140 [2023-11-06 22:12:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:12:56,092 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2023-11-06 22:12:56,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:12:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2023-11-06 22:12:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:12:56,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:12:56,101 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:56,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:12:56,101 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:12:56,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1519678118, now seen corresponding path program 1 times [2023-11-06 22:12:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:56,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119830609] [2023-11-06 22:12:56,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:56,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:00,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119830609] [2023-11-06 22:13:00,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119830609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:00,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:00,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:13:00,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775450806] [2023-11-06 22:13:00,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:00,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:13:00,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:00,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:13:00,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:13:00,282 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:13:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:01,071 INFO L93 Difference]: Finished difference Result 336 states and 470 transitions. [2023-11-06 22:13:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:13:01,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 140 [2023-11-06 22:13:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:01,076 INFO L225 Difference]: With dead ends: 336 [2023-11-06 22:13:01,077 INFO L226 Difference]: Without dead ends: 225 [2023-11-06 22:13:01,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:13:01,089 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 148 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:01,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 456 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:13:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-06 22:13:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2023-11-06 22:13:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 178 states have (on average 1.3258426966292134) internal successors, (236), 178 states have internal predecessors, (236), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:13:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 308 transitions. [2023-11-06 22:13:01,141 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 308 transitions. Word has length 140 [2023-11-06 22:13:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:01,141 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 308 transitions. [2023-11-06 22:13:01,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:13:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 308 transitions. [2023-11-06 22:13:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-06 22:13:01,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:01,146 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:01,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:13:01,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:01,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:01,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1542625043, now seen corresponding path program 1 times [2023-11-06 22:13:01,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:01,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828585026] [2023-11-06 22:13:01,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:01,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:07,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:07,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828585026] [2023-11-06 22:13:07,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828585026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:07,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:07,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:13:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346559633] [2023-11-06 22:13:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:07,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:13:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:07,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:13:07,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:13:07,423 INFO L87 Difference]: Start difference. First operand 219 states and 308 transitions. Second operand has 10 states, 7 states have (on average 7.857142857142857) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:08,371 INFO L93 Difference]: Finished difference Result 330 states and 463 transitions. [2023-11-06 22:13:08,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:13:08,372 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 7.857142857142857) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2023-11-06 22:13:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:08,375 INFO L225 Difference]: With dead ends: 330 [2023-11-06 22:13:08,375 INFO L226 Difference]: Without dead ends: 219 [2023-11-06 22:13:08,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:13:08,377 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 128 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:08,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 454 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:13:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-06 22:13:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 112. [2023-11-06 22:13:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:13:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2023-11-06 22:13:08,406 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 142 [2023-11-06 22:13:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:08,407 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2023-11-06 22:13:08,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 7.857142857142857) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2023-11-06 22:13:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-06 22:13:08,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:08,409 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:08,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:13:08,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:08,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1602478714, now seen corresponding path program 1 times [2023-11-06 22:13:08,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:08,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869556850] [2023-11-06 22:13:08,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:08,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:08,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869556850] [2023-11-06 22:13:08,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869556850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:08,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:08,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:13:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517148200] [2023-11-06 22:13:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:08,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:13:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:08,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:13:08,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:13:08,737 INFO L87 Difference]: Start difference. First operand 112 states and 155 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:08,775 INFO L93 Difference]: Finished difference Result 221 states and 307 transitions. [2023-11-06 22:13:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:13:08,776 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2023-11-06 22:13:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:08,777 INFO L225 Difference]: With dead ends: 221 [2023-11-06 22:13:08,778 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:13:08,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:13:08,779 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 36 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 261 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 22:13:08,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 261 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:13:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:13:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-06 22:13:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:13:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2023-11-06 22:13:08,810 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 145 [2023-11-06 22:13:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:08,810 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2023-11-06 22:13:08,811 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2023-11-06 22:13:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-06 22:13:08,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:08,813 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:08,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:13:08,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:08,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:08,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1015672700, now seen corresponding path program 1 times [2023-11-06 22:13:08,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:08,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101310181] [2023-11-06 22:13:08,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:08,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101310181] [2023-11-06 22:13:10,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101310181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:10,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:10,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:13:10,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597334928] [2023-11-06 22:13:10,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:10,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:13:10,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:10,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:13:10,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:13:10,378 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:13:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:11,051 INFO L93 Difference]: Finished difference Result 310 states and 424 transitions. [2023-11-06 22:13:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:13:11,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2023-11-06 22:13:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:11,054 INFO L225 Difference]: With dead ends: 310 [2023-11-06 22:13:11,054 INFO L226 Difference]: Without dead ends: 201 [2023-11-06 22:13:11,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:13:11,055 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 169 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:11,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 896 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:13:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-06 22:13:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 187. [2023-11-06 22:13:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 155 states have internal predecessors, (199), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:13:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 255 transitions. [2023-11-06 22:13:11,099 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 255 transitions. Word has length 145 [2023-11-06 22:13:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:11,099 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 255 transitions. [2023-11-06 22:13:11,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:13:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 255 transitions. [2023-11-06 22:13:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-06 22:13:11,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:11,102 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:11,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:13:11,103 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:11,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2143372836, now seen corresponding path program 1 times [2023-11-06 22:13:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853346899] [2023-11-06 22:13:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:14,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:14,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853346899] [2023-11-06 22:13:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853346899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:14,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:14,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:13:14,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894704226] [2023-11-06 22:13:14,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:14,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:13:14,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:14,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:13:14,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:13:14,233 INFO L87 Difference]: Start difference. First operand 187 states and 255 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:13:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:15,855 INFO L93 Difference]: Finished difference Result 671 states and 916 transitions. [2023-11-06 22:13:15,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:13:15,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2023-11-06 22:13:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:15,862 INFO L225 Difference]: With dead ends: 671 [2023-11-06 22:13:15,862 INFO L226 Difference]: Without dead ends: 487 [2023-11-06 22:13:15,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:13:15,865 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 248 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:15,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 828 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:13:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2023-11-06 22:13:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 416. [2023-11-06 22:13:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 348 states have (on average 1.3074712643678161) internal successors, (455), 351 states have internal predecessors, (455), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-11-06 22:13:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 571 transitions. [2023-11-06 22:13:15,980 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 571 transitions. Word has length 146 [2023-11-06 22:13:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:15,980 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 571 transitions. [2023-11-06 22:13:15,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:13:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 571 transitions. [2023-11-06 22:13:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-06 22:13:15,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:15,983 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:15,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:13:15,984 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:15,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1450529882, now seen corresponding path program 1 times [2023-11-06 22:13:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:15,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322069528] [2023-11-06 22:13:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:17,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:17,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322069528] [2023-11-06 22:13:17,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322069528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:17,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:17,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:13:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344783791] [2023-11-06 22:13:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:17,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:13:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:13:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:13:17,756 INFO L87 Difference]: Start difference. First operand 416 states and 571 transitions. Second operand has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:13:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:18,314 INFO L93 Difference]: Finished difference Result 1045 states and 1434 transitions. [2023-11-06 22:13:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:13:18,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2023-11-06 22:13:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:18,326 INFO L225 Difference]: With dead ends: 1045 [2023-11-06 22:13:18,327 INFO L226 Difference]: Without dead ends: 632 [2023-11-06 22:13:18,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:13:18,330 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 106 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:18,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 617 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:13:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2023-11-06 22:13:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 442. [2023-11-06 22:13:18,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.2941176470588236) internal successors, (484), 377 states have internal predecessors, (484), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-11-06 22:13:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 600 transitions. [2023-11-06 22:13:18,431 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 600 transitions. Word has length 146 [2023-11-06 22:13:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:18,436 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 600 transitions. [2023-11-06 22:13:18,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:13:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 600 transitions. [2023-11-06 22:13:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-06 22:13:18,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:18,439 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:18,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:13:18,440 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:18,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1325724386, now seen corresponding path program 1 times [2023-11-06 22:13:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:18,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727330912] [2023-11-06 22:13:18,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:18,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:19,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:20,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:20,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727330912] [2023-11-06 22:13:20,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727330912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:20,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:20,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:13:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206560747] [2023-11-06 22:13:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:20,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:13:20,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:20,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:13:20,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:13:20,033 INFO L87 Difference]: Start difference. First operand 442 states and 600 transitions. Second operand has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:13:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:20,627 INFO L93 Difference]: Finished difference Result 973 states and 1321 transitions. [2023-11-06 22:13:20,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:13:20,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2023-11-06 22:13:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:20,633 INFO L225 Difference]: With dead ends: 973 [2023-11-06 22:13:20,633 INFO L226 Difference]: Without dead ends: 534 [2023-11-06 22:13:20,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:13:20,635 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 82 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:20,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 668 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:13:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-11-06 22:13:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2023-11-06 22:13:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.2834224598930482) internal successors, (480), 377 states have internal predecessors, (480), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-11-06 22:13:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 596 transitions. [2023-11-06 22:13:20,722 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 596 transitions. Word has length 146 [2023-11-06 22:13:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:20,723 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 596 transitions. [2023-11-06 22:13:20,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:13:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 596 transitions. [2023-11-06 22:13:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-06 22:13:20,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:20,727 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:20,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:13:20,727 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:20,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2026788964, now seen corresponding path program 1 times [2023-11-06 22:13:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:20,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978282534] [2023-11-06 22:13:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:20,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:22,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:22,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978282534] [2023-11-06 22:13:22,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978282534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:22,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:22,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:13:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129414146] [2023-11-06 22:13:22,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:22,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:13:22,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:22,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:13:22,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:13:22,537 INFO L87 Difference]: Start difference. First operand 442 states and 596 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:23,809 INFO L93 Difference]: Finished difference Result 925 states and 1244 transitions. [2023-11-06 22:13:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:13:23,809 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2023-11-06 22:13:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:23,814 INFO L225 Difference]: With dead ends: 925 [2023-11-06 22:13:23,814 INFO L226 Difference]: Without dead ends: 486 [2023-11-06 22:13:23,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:13:23,816 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 245 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:23,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 721 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:13:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-11-06 22:13:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 442. [2023-11-06 22:13:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 374 states have (on average 1.2807486631016043) internal successors, (479), 377 states have internal predecessors, (479), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-11-06 22:13:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 595 transitions. [2023-11-06 22:13:23,907 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 595 transitions. Word has length 146 [2023-11-06 22:13:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:23,908 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 595 transitions. [2023-11-06 22:13:23,908 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 595 transitions. [2023-11-06 22:13:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-06 22:13:23,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:23,911 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:23,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:13:23,912 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:23,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:23,912 INFO L85 PathProgramCache]: Analyzing trace with hash -390002472, now seen corresponding path program 1 times [2023-11-06 22:13:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:23,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259771760] [2023-11-06 22:13:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:23,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:24,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259771760] [2023-11-06 22:13:24,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259771760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:24,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:24,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:13:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332226880] [2023-11-06 22:13:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:24,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:13:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:24,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:13:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:13:24,167 INFO L87 Difference]: Start difference. First operand 442 states and 595 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:24,304 INFO L93 Difference]: Finished difference Result 956 states and 1287 transitions. [2023-11-06 22:13:24,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:13:24,305 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2023-11-06 22:13:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:24,330 INFO L225 Difference]: With dead ends: 956 [2023-11-06 22:13:24,344 INFO L226 Difference]: Without dead ends: 517 [2023-11-06 22:13:24,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:13:24,346 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 74 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:24,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 727 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:13:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-11-06 22:13:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 456. [2023-11-06 22:13:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 388 states have (on average 1.2706185567010309) internal successors, (493), 391 states have internal predecessors, (493), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-11-06 22:13:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 609 transitions. [2023-11-06 22:13:24,516 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 609 transitions. Word has length 147 [2023-11-06 22:13:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:24,517 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 609 transitions. [2023-11-06 22:13:24,517 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 609 transitions. [2023-11-06 22:13:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-06 22:13:24,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:24,520 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:24,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:13:24,520 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:24,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1451337970, now seen corresponding path program 1 times [2023-11-06 22:13:24,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:24,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389501453] [2023-11-06 22:13:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:24,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:24,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389501453] [2023-11-06 22:13:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389501453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:24,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:13:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699342679] [2023-11-06 22:13:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:24,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:13:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:13:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:13:24,766 INFO L87 Difference]: Start difference. First operand 456 states and 609 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:24,875 INFO L93 Difference]: Finished difference Result 949 states and 1270 transitions. [2023-11-06 22:13:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:13:24,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2023-11-06 22:13:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:24,881 INFO L225 Difference]: With dead ends: 949 [2023-11-06 22:13:24,882 INFO L226 Difference]: Without dead ends: 496 [2023-11-06 22:13:24,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:13:24,884 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 32 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 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 22:13:24,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 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 22:13:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-11-06 22:13:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 471. [2023-11-06 22:13:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 403 states have (on average 1.260545905707196) internal successors, (508), 406 states have internal predecessors, (508), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-11-06 22:13:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 624 transitions. [2023-11-06 22:13:24,964 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 624 transitions. Word has length 147 [2023-11-06 22:13:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:24,965 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 624 transitions. [2023-11-06 22:13:24,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 624 transitions. [2023-11-06 22:13:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:13:24,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:24,967 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:24,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:13:24,968 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:24,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1207686357, now seen corresponding path program 1 times [2023-11-06 22:13:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:24,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086933722] [2023-11-06 22:13:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:29,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086933722] [2023-11-06 22:13:29,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086933722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:29,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:29,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-06 22:13:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571405594] [2023-11-06 22:13:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:29,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:13:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:29,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:13:29,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:13:29,310 INFO L87 Difference]: Start difference. First operand 471 states and 624 transitions. Second operand has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:34,156 INFO L93 Difference]: Finished difference Result 783 states and 1031 transitions. [2023-11-06 22:13:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:13:34,156 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 148 [2023-11-06 22:13:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:34,160 INFO L225 Difference]: With dead ends: 783 [2023-11-06 22:13:34,161 INFO L226 Difference]: Without dead ends: 568 [2023-11-06 22:13:34,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:13:34,163 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 301 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:34,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1129 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-06 22:13:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2023-11-06 22:13:34,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 513. [2023-11-06 22:13:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 442 states have (on average 1.260180995475113) internal successors, (557), 446 states have internal predecessors, (557), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-06 22:13:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 677 transitions. [2023-11-06 22:13:34,261 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 677 transitions. Word has length 148 [2023-11-06 22:13:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:34,262 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 677 transitions. [2023-11-06 22:13:34,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 677 transitions. [2023-11-06 22:13:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-06 22:13:34,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:34,266 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:34,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:13:34,267 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:34,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:34,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1324270229, now seen corresponding path program 1 times [2023-11-06 22:13:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:34,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413481861] [2023-11-06 22:13:34,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:34,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:36,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:36,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413481861] [2023-11-06 22:13:36,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413481861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:36,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:36,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:13:36,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576669432] [2023-11-06 22:13:36,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:36,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:13:36,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:36,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:13:36,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:13:36,914 INFO L87 Difference]: Start difference. First operand 513 states and 677 transitions. Second operand has 13 states, 11 states have (on average 5.545454545454546) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:13:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:39,408 INFO L93 Difference]: Finished difference Result 997 states and 1303 transitions. [2023-11-06 22:13:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:13:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.545454545454546) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2023-11-06 22:13:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:39,414 INFO L225 Difference]: With dead ends: 997 [2023-11-06 22:13:39,414 INFO L226 Difference]: Without dead ends: 740 [2023-11-06 22:13:39,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:13:39,416 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 179 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:39,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1632 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 22:13:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2023-11-06 22:13:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 535. [2023-11-06 22:13:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 464 states have (on average 1.2650862068965518) internal successors, (587), 468 states have internal predecessors, (587), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-06 22:13:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 707 transitions. [2023-11-06 22:13:39,524 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 707 transitions. Word has length 148 [2023-11-06 22:13:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:39,525 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 707 transitions. [2023-11-06 22:13:39,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.545454545454546) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:13:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 707 transitions. [2023-11-06 22:13:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-06 22:13:39,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:39,528 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:39,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:13:39,528 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:39,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:39,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2068856573, now seen corresponding path program 1 times [2023-11-06 22:13:39,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:39,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848511588] [2023-11-06 22:13:39,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:39,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:39,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848511588] [2023-11-06 22:13:39,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848511588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:39,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:39,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:13:39,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32761367] [2023-11-06 22:13:39,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:39,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:13:39,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:39,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:13:39,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:13:39,754 INFO L87 Difference]: Start difference. First operand 535 states and 707 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:39,962 INFO L93 Difference]: Finished difference Result 1271 states and 1669 transitions. [2023-11-06 22:13:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:13:39,963 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2023-11-06 22:13:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:39,968 INFO L225 Difference]: With dead ends: 1271 [2023-11-06 22:13:39,968 INFO L226 Difference]: Without dead ends: 739 [2023-11-06 22:13:39,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:13:39,970 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 94 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:39,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 905 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:13:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-11-06 22:13:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 541. [2023-11-06 22:13:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 470 states have (on average 1.2617021276595746) internal successors, (593), 474 states have internal predecessors, (593), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-06 22:13:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 713 transitions. [2023-11-06 22:13:40,052 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 713 transitions. Word has length 149 [2023-11-06 22:13:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:40,052 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 713 transitions. [2023-11-06 22:13:40,053 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:13:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 713 transitions. [2023-11-06 22:13:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-06 22:13:40,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:40,055 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:40,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:13:40,056 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:40,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash -621698327, now seen corresponding path program 1 times [2023-11-06 22:13:40,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:40,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624280197] [2023-11-06 22:13:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:41,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:41,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624280197] [2023-11-06 22:13:41,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624280197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:41,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:41,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:13:41,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251523708] [2023-11-06 22:13:41,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:41,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:13:41,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:41,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:13:41,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:13:41,876 INFO L87 Difference]: Start difference. First operand 541 states and 713 transitions. Second operand has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:13:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:43,262 INFO L93 Difference]: Finished difference Result 1349 states and 1822 transitions. [2023-11-06 22:13:43,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:13:43,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2023-11-06 22:13:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:43,272 INFO L225 Difference]: With dead ends: 1349 [2023-11-06 22:13:43,272 INFO L226 Difference]: Without dead ends: 1347 [2023-11-06 22:13:43,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:13:43,274 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 198 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:43,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1212 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:13:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2023-11-06 22:13:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 805. [2023-11-06 22:13:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 728 states have (on average 1.260989010989011) internal successors, (918), 734 states have internal predecessors, (918), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-06 22:13:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1046 transitions. [2023-11-06 22:13:43,423 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1046 transitions. Word has length 149 [2023-11-06 22:13:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:43,424 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1046 transitions. [2023-11-06 22:13:43,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:13:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1046 transitions. [2023-11-06 22:13:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-06 22:13:43,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:43,427 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:43,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:13:43,427 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:43,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 256648277, now seen corresponding path program 1 times [2023-11-06 22:13:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287280460] [2023-11-06 22:13:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:45,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:45,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287280460] [2023-11-06 22:13:45,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287280460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:45,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:45,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:13:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197956042] [2023-11-06 22:13:45,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:45,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:13:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:45,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:13:45,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:13:45,247 INFO L87 Difference]: Start difference. First operand 805 states and 1046 transitions. Second operand has 8 states, 5 states have (on average 12.4) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:46,034 INFO L93 Difference]: Finished difference Result 1934 states and 2505 transitions. [2023-11-06 22:13:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:13:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 12.4) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 149 [2023-11-06 22:13:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:46,042 INFO L225 Difference]: With dead ends: 1934 [2023-11-06 22:13:46,042 INFO L226 Difference]: Without dead ends: 1132 [2023-11-06 22:13:46,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:13:46,045 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 82 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:46,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 647 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:13:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2023-11-06 22:13:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 829. [2023-11-06 22:13:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 756 states have (on average 1.2592592592592593) internal successors, (952), 760 states have internal predecessors, (952), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-06 22:13:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1072 transitions. [2023-11-06 22:13:46,164 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1072 transitions. Word has length 149 [2023-11-06 22:13:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:46,165 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 1072 transitions. [2023-11-06 22:13:46,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 12.4) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1072 transitions. [2023-11-06 22:13:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-06 22:13:46,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:46,168 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:46,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:13:46,168 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:46,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1072057838, now seen corresponding path program 1 times [2023-11-06 22:13:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:46,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194171355] [2023-11-06 22:13:46,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:46,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:13:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:48,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194171355] [2023-11-06 22:13:48,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194171355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:48,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:48,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-06 22:13:48,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992270933] [2023-11-06 22:13:48,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:48,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:13:48,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:13:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:13:48,630 INFO L87 Difference]: Start difference. First operand 829 states and 1072 transitions. Second operand has 19 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:13:52,421 INFO L93 Difference]: Finished difference Result 1717 states and 2225 transitions. [2023-11-06 22:13:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-06 22:13:52,422 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2023-11-06 22:13:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:13:52,429 INFO L225 Difference]: With dead ends: 1717 [2023-11-06 22:13:52,429 INFO L226 Difference]: Without dead ends: 1179 [2023-11-06 22:13:52,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=437, Invalid=2319, Unknown=0, NotChecked=0, Total=2756 [2023-11-06 22:13:52,432 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 443 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:13:52,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 2475 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-06 22:13:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2023-11-06 22:13:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 975. [2023-11-06 22:13:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 872 states have (on average 1.2591743119266054) internal successors, (1098), 878 states have internal predecessors, (1098), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-06 22:13:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1266 transitions. [2023-11-06 22:13:52,605 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1266 transitions. Word has length 151 [2023-11-06 22:13:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:13:52,605 INFO L495 AbstractCegarLoop]: Abstraction has 975 states and 1266 transitions. [2023-11-06 22:13:52,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:13:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1266 transitions. [2023-11-06 22:13:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-06 22:13:52,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:13:52,608 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:52,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:13:52,609 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:13:52,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash -906512689, now seen corresponding path program 1 times [2023-11-06 22:13:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860785665] [2023-11-06 22:13:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:52,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:13:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:13:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:13:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:13:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:13:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:13:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:13:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:13:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:13:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:13:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:13:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:13:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:13:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:13:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:13:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:13:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:13:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:13:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:13:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:54,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860785665] [2023-11-06 22:13:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860785665] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:13:54,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893153644] [2023-11-06 22:13:54,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:54,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:13:54,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:13:54,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:13:54,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:13:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:55,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-06 22:13:55,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:13:55,811 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:55,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 64 treesize of output 22 [2023-11-06 22:13:55,905 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:13:55,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:13:55,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:13:56,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:13:56,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:13:56,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:13:56,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:13:56,147 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:13:56,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:13:56,212 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:13:56,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-06 22:13:56,352 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:56,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49 [2023-11-06 22:13:56,480 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:56,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 17 [2023-11-06 22:13:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2023-11-06 22:13:56,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:13:57,245 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:13:57,246 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 1 [2023-11-06 22:13:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:13:57,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893153644] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:13:57,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:13:57,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 28 [2023-11-06 22:13:57,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208796513] [2023-11-06 22:13:57,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:13:57,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-06 22:13:57,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-06 22:13:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2023-11-06 22:13:57,257 INFO L87 Difference]: Start difference. First operand 975 states and 1266 transitions. Second operand has 28 states, 25 states have (on average 6.52) internal successors, (163), 28 states have internal predecessors, (163), 8 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 5 states have call predecessors, (52), 8 states have call successors, (52) [2023-11-06 22:14:00,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:00,922 INFO L93 Difference]: Finished difference Result 2182 states and 2808 transitions. [2023-11-06 22:14:00,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-06 22:14:00,923 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.52) internal successors, (163), 28 states have internal predecessors, (163), 8 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 5 states have call predecessors, (52), 8 states have call successors, (52) Word has length 151 [2023-11-06 22:14:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:00,931 INFO L225 Difference]: With dead ends: 2182 [2023-11-06 22:14:00,932 INFO L226 Difference]: Without dead ends: 1210 [2023-11-06 22:14:00,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=546, Invalid=2316, Unknown=0, NotChecked=0, Total=2862 [2023-11-06 22:14:00,936 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 2380 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:00,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2388 Valid, 1024 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-06 22:14:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2023-11-06 22:14:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 930. [2023-11-06 22:14:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 821 states have (on average 1.2557856272838002) internal successors, (1031), 827 states have internal predecessors, (1031), 84 states have call successors, (84), 24 states have call predecessors, (84), 24 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-06 22:14:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1199 transitions. [2023-11-06 22:14:01,204 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1199 transitions. Word has length 151 [2023-11-06 22:14:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:01,204 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 1199 transitions. [2023-11-06 22:14:01,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.52) internal successors, (163), 28 states have internal predecessors, (163), 8 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 5 states have call predecessors, (52), 8 states have call successors, (52) [2023-11-06 22:14:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1199 transitions. [2023-11-06 22:14:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-06 22:14:01,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:01,207 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:01,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:01,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:01,416 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:01,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash 303152595, now seen corresponding path program 1 times [2023-11-06 22:14:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:01,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881866026] [2023-11-06 22:14:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:14:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:14:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:14:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:14:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:14:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:14:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:14:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:14:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:14:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:14:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:14:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:14:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:14:02,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:02,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881866026] [2023-11-06 22:14:02,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881866026] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:02,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952375129] [2023-11-06 22:14:02,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:02,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:02,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:02,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:02,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:14:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:03,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-06 22:14:03,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:03,926 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:03,927 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 19 [2023-11-06 22:14:03,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,000 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,163 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,288 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:04,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-11-06 22:14:04,315 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:04,315 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2023-11-06 22:14:04,419 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:04,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 23 [2023-11-06 22:14:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:14:04,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:04,892 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:04,893 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 1 [2023-11-06 22:14:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:14:04,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952375129] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:14:04,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:14:04,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2023-11-06 22:14:04,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447827953] [2023-11-06 22:14:04,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:04,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 22:14:04,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:04,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 22:14:04,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:14:04,902 INFO L87 Difference]: Start difference. First operand 930 states and 1199 transitions. Second operand has 18 states, 16 states have (on average 8.0625) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 2 states have call predecessors, (53), 4 states have call successors, (53) [2023-11-06 22:14:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:06,135 INFO L93 Difference]: Finished difference Result 1796 states and 2298 transitions. [2023-11-06 22:14:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:14:06,136 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.0625) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 2 states have call predecessors, (53), 4 states have call successors, (53) Word has length 151 [2023-11-06 22:14:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:06,140 INFO L225 Difference]: With dead ends: 1796 [2023-11-06 22:14:06,140 INFO L226 Difference]: Without dead ends: 869 [2023-11-06 22:14:06,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2023-11-06 22:14:06,143 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 270 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:06,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 507 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:14:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2023-11-06 22:14:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 590. [2023-11-06 22:14:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 511 states have (on average 1.2407045009784736) internal successors, (634), 516 states have internal predecessors, (634), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 22:14:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 746 transitions. [2023-11-06 22:14:06,345 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 746 transitions. Word has length 151 [2023-11-06 22:14:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:06,346 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 746 transitions. [2023-11-06 22:14:06,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.0625) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 2 states have call predecessors, (53), 4 states have call successors, (53) [2023-11-06 22:14:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 746 transitions. [2023-11-06 22:14:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-06 22:14:06,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:06,349 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:06,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:06,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:06,557 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:06,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1446665465, now seen corresponding path program 1 times [2023-11-06 22:14:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:06,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840642227] [2023-11-06 22:14:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:06,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:14:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:14:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:14:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:14:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:14:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:14:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:14:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:14:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:14:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:14:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:14:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:14:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:14:08,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:08,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840642227] [2023-11-06 22:14:08,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840642227] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:08,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499140413] [2023-11-06 22:14:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:08,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:08,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:08,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:14:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:08,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-06 22:14:08,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:08,806 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:08,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 13 [2023-11-06 22:14:08,867 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:14:08,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:14:08,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:14:08,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:14:08,967 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:14:08,995 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-06 22:14:09,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:14:09,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 63 [2023-11-06 22:14:09,093 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:09,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 101 [2023-11-06 22:14:09,107 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:09,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 54 [2023-11-06 22:14:09,201 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:09,201 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 73 [2023-11-06 22:14:09,603 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:09,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 40 [2023-11-06 22:14:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 311 proven. 30 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2023-11-06 22:14:09,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-06 22:14:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499140413] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:14:10,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:14:10,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 21 [2023-11-06 22:14:10,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867881480] [2023-11-06 22:14:10,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:10,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 22:14:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:10,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 22:14:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:14:10,096 INFO L87 Difference]: Start difference. First operand 590 states and 746 transitions. Second operand has 21 states, 17 states have (on average 8.470588235294118) internal successors, (144), 21 states have internal predecessors, (144), 7 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 7 states have call successors, (47) [2023-11-06 22:14:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:13,875 INFO L93 Difference]: Finished difference Result 1522 states and 1882 transitions. [2023-11-06 22:14:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-06 22:14:13,876 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.470588235294118) internal successors, (144), 21 states have internal predecessors, (144), 7 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 7 states have call successors, (47) Word has length 152 [2023-11-06 22:14:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:13,881 INFO L225 Difference]: With dead ends: 1522 [2023-11-06 22:14:13,881 INFO L226 Difference]: Without dead ends: 935 [2023-11-06 22:14:13,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 336 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1668 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=955, Invalid=4447, Unknown=0, NotChecked=0, Total=5402 [2023-11-06 22:14:13,886 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 917 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:13,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 803 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-06 22:14:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2023-11-06 22:14:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 540. [2023-11-06 22:14:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 457 states have (on average 1.2035010940919038) internal successors, (550), 462 states have internal predecessors, (550), 56 states have call successors, (56), 26 states have call predecessors, (56), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 22:14:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 662 transitions. [2023-11-06 22:14:14,094 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 662 transitions. Word has length 152 [2023-11-06 22:14:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:14,094 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 662 transitions. [2023-11-06 22:14:14,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.470588235294118) internal successors, (144), 21 states have internal predecessors, (144), 7 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 7 states have call successors, (47) [2023-11-06 22:14:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 662 transitions. [2023-11-06 22:14:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-06 22:14:14,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:14,097 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:14,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:14,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:14,304 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:14,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash 977273159, now seen corresponding path program 1 times [2023-11-06 22:14:14,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:14,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149032924] [2023-11-06 22:14:14,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:14,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:14:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:14:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:14:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:14:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:14:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:14:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:14:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:14:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:14:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:14:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:14:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:14:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 120 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2023-11-06 22:14:16,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:16,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149032924] [2023-11-06 22:14:16,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149032924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:16,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770111342] [2023-11-06 22:14:16,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:16,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:16,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:16,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:16,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:14:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-06 22:14:20,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:20,562 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:20,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 73 treesize of output 25 [2023-11-06 22:14:20,724 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-11-06 22:14:20,886 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:20,886 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 35 [2023-11-06 22:14:20,962 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:20,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 35 [2023-11-06 22:14:21,029 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:21,029 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 35 [2023-11-06 22:14:21,088 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:21,088 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 35 [2023-11-06 22:14:21,178 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2023-11-06 22:14:21,447 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:21,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 49 [2023-11-06 22:14:21,554 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:14:21,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 49 [2023-11-06 22:14:21,691 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2023-11-06 22:14:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 379 proven. 120 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-11-06 22:14:21,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 93 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2023-11-06 22:14:23,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770111342] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:14:23,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:14:23,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 16] total 38 [2023-11-06 22:14:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905476200] [2023-11-06 22:14:23,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:23,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-06 22:14:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:23,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-06 22:14:23,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 [2023-11-06 22:14:23,652 INFO L87 Difference]: Start difference. First operand 540 states and 662 transitions. Second operand has 38 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 36 states have internal predecessors, (144), 18 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (49), 11 states have call predecessors, (49), 18 states have call successors, (49) [2023-11-06 22:14:25,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:14:31,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:14:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:32,478 INFO L93 Difference]: Finished difference Result 956 states and 1155 transitions. [2023-11-06 22:14:32,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 22:14:32,479 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 36 states have internal predecessors, (144), 18 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (49), 11 states have call predecessors, (49), 18 states have call successors, (49) Word has length 154 [2023-11-06 22:14:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:32,484 INFO L225 Difference]: With dead ends: 956 [2023-11-06 22:14:32,485 INFO L226 Difference]: Without dead ends: 419 [2023-11-06 22:14:32,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 330 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=506, Invalid=1944, Unknown=0, NotChecked=0, Total=2450 [2023-11-06 22:14:32,488 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 399 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 75 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:32,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 624 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1391 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2023-11-06 22:14:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-11-06 22:14:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 331. [2023-11-06 22:14:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 265 states have (on average 1.181132075471698) internal successors, (313), 267 states have internal predecessors, (313), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-06 22:14:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 397 transitions. [2023-11-06 22:14:32,615 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 397 transitions. Word has length 154 [2023-11-06 22:14:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:32,615 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 397 transitions. [2023-11-06 22:14:32,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 36 states have internal predecessors, (144), 18 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (49), 11 states have call predecessors, (49), 18 states have call successors, (49) [2023-11-06 22:14:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 397 transitions. [2023-11-06 22:14:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 22:14:32,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:32,617 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:32,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:32,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:32,826 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:32,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:32,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1437396814, now seen corresponding path program 1 times [2023-11-06 22:14:32,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:32,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379100499] [2023-11-06 22:14:32,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:32,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:14:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:14:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:14:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:14:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:14:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:14:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:14:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:14:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:14:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:14:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:14:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:14:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:14:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:14:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:14:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:14:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:14:34,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:34,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379100499] [2023-11-06 22:14:34,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379100499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:34,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:14:34,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766413182] [2023-11-06 22:14:34,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:34,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:14:34,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:34,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:14:34,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:14:34,724 INFO L87 Difference]: Start difference. First operand 331 states and 397 transitions. Second operand has 9 states, 6 states have (on average 11.5) internal successors, (69), 9 states have internal predecessors, (69), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:14:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:35,331 INFO L93 Difference]: Finished difference Result 592 states and 711 transitions. [2023-11-06 22:14:35,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:14:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.5) internal successors, (69), 9 states have internal predecessors, (69), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 156 [2023-11-06 22:14:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:35,334 INFO L225 Difference]: With dead ends: 592 [2023-11-06 22:14:35,334 INFO L226 Difference]: Without dead ends: 331 [2023-11-06 22:14:35,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:14:35,337 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 56 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:35,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 517 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:14:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-06 22:14:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2023-11-06 22:14:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 265 states have (on average 1.1735849056603773) internal successors, (311), 267 states have internal predecessors, (311), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-06 22:14:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 395 transitions. [2023-11-06 22:14:35,473 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 395 transitions. Word has length 156 [2023-11-06 22:14:35,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:35,474 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 395 transitions. [2023-11-06 22:14:35,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.5) internal successors, (69), 9 states have internal predecessors, (69), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:14:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 395 transitions. [2023-11-06 22:14:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-06 22:14:35,475 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:35,475 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:35,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:14:35,477 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:35,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:35,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1113914987, now seen corresponding path program 1 times [2023-11-06 22:14:35,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:35,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274805061] [2023-11-06 22:14:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:35,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:35,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:14:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:35,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:14:35,796 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:14:35,797 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:14:35,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:14:35,804 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] [2023-11-06 22:14:35,809 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:14:35,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:14:35 BoogieIcfgContainer [2023-11-06 22:14:35,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:14:35,937 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:14:35,937 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:14:35,937 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:14:35,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:50" (3/4) ... [2023-11-06 22:14:35,940 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:14:35,941 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:14:35,941 INFO L158 Benchmark]: Toolchain (without parser) took 106931.51ms. Allocated memory was 134.2MB in the beginning and 897.6MB in the end (delta: 763.4MB). Free memory was 80.6MB in the beginning and 600.8MB in the end (delta: -520.2MB). Peak memory consumption was 246.4MB. Max. memory is 16.1GB. [2023-11-06 22:14:35,942 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 100.1MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:14:35,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.89ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 80.3MB in the beginning and 152.9MB in the end (delta: -72.6MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2023-11-06 22:14:35,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.40ms. Allocated memory is still 186.6MB. Free memory was 152.9MB in the beginning and 148.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:14:35,943 INFO L158 Benchmark]: Boogie Preprocessor took 85.86ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 145.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:14:35,945 INFO L158 Benchmark]: RCFGBuilder took 907.50ms. Allocated memory is still 186.6MB. Free memory was 145.3MB in the beginning and 116.0MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-06 22:14:35,950 INFO L158 Benchmark]: TraceAbstraction took 105400.99ms. Allocated memory was 186.6MB in the beginning and 897.6MB in the end (delta: 710.9MB). Free memory was 115.1MB in the beginning and 601.8MB in the end (delta: -486.7MB). Peak memory consumption was 222.8MB. Max. memory is 16.1GB. [2023-11-06 22:14:35,950 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 897.6MB. Free memory is still 600.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:14:35,953 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.31ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 100.1MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.89ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 80.3MB in the beginning and 152.9MB in the end (delta: -72.6MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.40ms. Allocated memory is still 186.6MB. Free memory was 152.9MB in the beginning and 148.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.86ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 145.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 907.50ms. Allocated memory is still 186.6MB. Free memory was 145.3MB in the beginning and 116.0MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 105400.99ms. Allocated memory was 186.6MB in the beginning and 897.6MB in the end (delta: 710.9MB). Free memory was 115.1MB in the beginning and 601.8MB in the end (delta: -486.7MB). Peak memory consumption was 222.8MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 897.6MB. Free memory is still 600.8MB. 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 119. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 5, 1456677701, 1000000000, 1, 0, 0, 0, 256.5, 8.8, 1, 16, 3110219175, 128, 1, 0 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] FCALL updateLastVariables() [L127] CALL updateVariables() [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_3=-2147483649, WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741823) VAL [WrapperStruct00.var_1_3=-2147483649, WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_3=-2147483649, WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483647) VAL [WrapperStruct00.var_1_3=-2147483649, WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ulong() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=-3221225473, WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 536870911) VAL [WrapperStruct00.var_1_4=-3221225473, WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=-3221225473, WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1073741823) VAL [WrapperStruct00.var_1_4=-3221225473, WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=536870911, WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00.var_1_5=536870911, WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=536870911, WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 536870911) VAL [WrapperStruct00.var_1_5=536870911, WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=-512, WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00.var_1_7=-512, WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=-512, WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00.var_1_7=-512, WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )=1, WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F=1, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )=1, WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F=1, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )=1, WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )=1, WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00.var_1_11=-255, WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 1) VAL [WrapperStruct00.var_1_11=-255, WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00.var_1_11=-255, WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00.var_1_11=-255, WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L107] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 2147483647) VAL [WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967295) VAL [WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=131070, WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00.var_1_14=131070, WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=131070, WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 65534) VAL [WrapperStruct00.var_1_14=131070, WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=-511, WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00.var_1_16=-511, WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=-511, WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00.var_1_16=-511, WrapperStruct00={4:0}, isInitial=1] [L127] RET updateVariables() [L128] CALL step() [L60] EXPR WrapperStruct00.var_1_7 [L60] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_7 [L61] EXPR WrapperStruct00.var_1_5 [L61] EXPR WrapperStruct00.var_1_13 [L61] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_5=536870911, WrapperStruct00={4:0}, isInitial=1] [L61] COND TRUE WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4) [L62] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=131070, WrapperStruct00={4:0}, isInitial=1] [L62] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) [L62] EXPR WrapperStruct00.var_1_14 [L62] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) VAL [((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)=65534, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_14=131070, WrapperStruct00={4:0}, isInitial=1] [L62] WrapperStruct00.var_1_12 = ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))) [L64] EXPR WrapperStruct00.var_1_9 [L64] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L64] COND FALSE !((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) [L67] EXPR WrapperStruct00.var_1_11 [L67] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16 [L67] EXPR WrapperStruct00.var_1_16 [L67] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16=1, WrapperStruct00.var_1_11=-255, WrapperStruct00.var_1_16=-511, WrapperStruct00={4:0}, isInitial=1] [L67] WrapperStruct00.var_1_15 = (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16) [L69] EXPR WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_3 [L69] EXPR WrapperStruct00.var_1_4 [L69] EXPR WrapperStruct00.var_1_12 [L69] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))) [L70] EXPR WrapperStruct00.var_1_12 [L70] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00={4:0}, isInitial=1] [L70] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12) [L70] EXPR WrapperStruct00.var_1_12 [L70] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12) VAL [((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00={4:0}, isInitial=1] [L70] signed long int stepLocal_1 = (((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)); [L71] EXPR WrapperStruct00.var_1_3 [L71] unsigned long int stepLocal_0 = WrapperStruct00.var_1_3; [L72] EXPR WrapperStruct00.var_1_4 [L72] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2147483647, stepLocal_1=65534] [L72] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) [L72] EXPR WrapperStruct00.var_1_4 [L72] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) VAL [((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2147483647, stepLocal_1=65534] [L72] COND TRUE stepLocal_1 != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3))) [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1, stepLocal_0=2147483647, stepLocal_1=65534] [L73] COND FALSE !(WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_1 [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_3 [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7)) [L119] EXPR WrapperStruct00.var_1_6 [L119] EXPR WrapperStruct00.var_1_7 [L119] EXPR (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7)) VAL [(WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))) [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_12 VAL [((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12) [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12) VAL [((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_3 VAL [((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3) VAL [((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)) [L119] EXPR WrapperStruct00.var_1_9 [L119] EXPR WrapperStruct00.var_1_10 VAL [((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1 VAL [((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)) VAL [(((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))=1, ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))) VAL [(((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))=1, ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1) [L119] EXPR WrapperStruct00.var_1_5 [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR WrapperStruct00.var_1_4 VAL [(((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))=1, (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)=1, ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_5=536870911, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1 [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_14 VAL [(((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))=1, (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)=1, ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_5=536870911, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) [L119] EXPR WrapperStruct00.var_1_14 [L119] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) VAL [(((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))=1, (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)=1, ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_5=536870911, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1 VAL [(((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))=1, (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)=1, ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_5=536870911, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1) VAL [(((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))=1, (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)=1, ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_5=536870911, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)) && (((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16)))) [L119] EXPR WrapperStruct00.var_1_9 [L119] EXPR WrapperStruct00.var_1_10 VAL [(((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))=1, ((((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)) && (((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16))))=1, (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)=1, ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_5=536870911, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16))) [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_11 [L119] EXPR ((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16))) VAL [(((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))=1, ((((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)) && (((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16))))=1, (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)=1, ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, ((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16)))=0, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_11=-255, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_15=1, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_5=536870911, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)) && (((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16)))) VAL [(((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11))=1, ((((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)) && (((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16))))=0, (((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)=1, ((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))=1, ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12)=65534, ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)=65534, ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)=-3221225473, ((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16)))=0, (WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))=1, (WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1=1, (WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1=1, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_10=13835058057429647367, WrapperStruct00.var_1_11=-255, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_12=65534, WrapperStruct00.var_1_13=13835058057429647359, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_14=131070, WrapperStruct00.var_1_15=1, WrapperStruct00.var_1_1=1073872892, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_3=-2147483649, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_4=-3221225473, WrapperStruct00.var_1_5=536870911, WrapperStruct00.var_1_6=-512, WrapperStruct00.var_1_7=-512, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00.var_1_9=13835058057429647364, WrapperStruct00={4:0}, isInitial=1] [L119-L120] return ((((WrapperStruct00.var_1_1 == ((unsigned long int) (WrapperStruct00.var_1_12 + (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_12))))) && (WrapperStruct00.var_1_6 == ((unsigned char) WrapperStruct00.var_1_7))) && ((((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_12))) != ((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_3)))) ? ((WrapperStruct00.var_1_9 == WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_6 ? ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_7 || WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_7))) : 1) : 1) : (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_11)))) && ((WrapperStruct00.var_1_5 <= (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14))))) : 1)) && (((WrapperStruct00.var_1_9 * 16.5f) > WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_15 == ((unsigned char) (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_16)))) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 105.2s, OverallIterations: 25, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 6827 SdHoareTripleChecker+Valid, 29.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6771 mSDsluCounter, 18559 SdHoareTripleChecker+Invalid, 26.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15336 mSDsCounter, 752 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17919 IncrementalHoareTripleChecker+Invalid, 18673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 752 mSolverCounterUnsat, 3223 mSDtfsCounter, 17919 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2740 GetRequests, 2302 SyntacticMatches, 13 SemanticMatches, 425 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3702 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=975occurred in iteration=19, InterpolantAutomatonStates: 362, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 3185 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 8.1s SatisfiabilityAnalysisTime, 52.1s InterpolantComputationTime, 4294 NumberOfCodeBlocks, 4294 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4712 ConstructedInterpolants, 0 QuantifiedInterpolants, 39787 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2039 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 18852/19584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:14:35,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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 a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:14:38,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:14:38,795 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:14:38,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:14:38,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:14:38,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:14:38,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:14:38,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:14:38,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:14:38,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:14:38,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:14:38,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:14:38,865 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:14:38,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:14:38,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:14:38,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:14:38,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:14:38,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:14:38,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:14:38,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:14:38,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:14:38,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:14:38,872 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:14:38,872 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:14:38,873 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:14:38,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:14:38,874 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:14:38,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:14:38,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:14:38,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:14:38,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:38,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:14:38,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:14:38,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:14:38,878 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:14:38,878 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:14:38,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:14:38,879 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:14:38,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:14:38,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:14:38,880 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:14:38,881 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:14:38,881 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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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 -> a57c51c3c35fc35fae3b673a01ba8d307f47b0272dfabe8304d0498d3ff6eff6 [2023-11-06 22:14:39,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:14:39,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:14:39,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:14:39,326 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:14:39,327 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:14:39,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i [2023-11-06 22:14:42,482 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:14:42,788 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:14:42,790 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i [2023-11-06 22:14:42,803 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/data/1f009c8c3/e2bd8680187844b1b3053fe500a07a4b/FLAG412bce9ae [2023-11-06 22:14:42,822 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/data/1f009c8c3/e2bd8680187844b1b3053fe500a07a4b [2023-11-06 22:14:42,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:14:42,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:14:42,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:42,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:14:42,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:14:42,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:42" (1/1) ... [2023-11-06 22:14:42,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2faf1117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:42, skipping insertion in model container [2023-11-06 22:14:42,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:42" (1/1) ... [2023-11-06 22:14:42,888 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:14:43,103 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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i[916,929] [2023-11-06 22:14:43,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:43,222 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:14:43,242 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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-53.i[916,929] [2023-11-06 22:14:43,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:43,376 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:14:43,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43 WrapperNode [2023-11-06 22:14:43,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:43,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:43,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:14:43,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:14:43,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,469 INFO L138 Inliner]: procedures = 36, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2023-11-06 22:14:43,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:43,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:14:43,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:14:43,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:14:43,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:14:43,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:14:43,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:14:43,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:14:43,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (1/1) ... [2023-11-06 22:14:43,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:43,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:43,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:14:43,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:14:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:14:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 22:14:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 22:14:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:14:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:14:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:14:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:14:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 22:14:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:14:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:14:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:14:43,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:14:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:14:43,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:14:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:14:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:14:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:14:43,749 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:14:43,751 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:14:45,355 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:14:45,365 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:14:45,365 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:14:45,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:45 BoogieIcfgContainer [2023-11-06 22:14:45,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:14:45,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:14:45,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:14:45,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:14:45,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:14:42" (1/3) ... [2023-11-06 22:14:45,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea5d4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:45, skipping insertion in model container [2023-11-06 22:14:45,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:43" (2/3) ... [2023-11-06 22:14:45,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea5d4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:45, skipping insertion in model container [2023-11-06 22:14:45,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:45" (3/3) ... [2023-11-06 22:14:45,380 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-53.i [2023-11-06 22:14:45,400 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:14:45,400 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:14:45,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:14:45,478 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;@314af184, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:14:45,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:14:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:14:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:14:45,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:45,508 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:45,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:45,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1513522922, now seen corresponding path program 1 times [2023-11-06 22:14:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:14:45,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138621401] [2023-11-06 22:14:45,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:45,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:14:45,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:14:45,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:14:45,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:14:45,873 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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)] Exception during sending of exit command (exit): Broken pipe [2023-11-06 22:14:45,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 139 [2023-11-06 22:14:46,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:14:46,074 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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 22:14:46,079 INFO L158 Benchmark]: Toolchain (without parser) took 3249.68ms. Allocated memory is still 90.2MB. Free memory was 65.9MB in the beginning and 62.3MB in the end (delta: 3.6MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2023-11-06 22:14:46,080 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 60.8MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:14:46,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.81ms. Allocated memory is still 90.2MB. Free memory was 65.7MB in the beginning and 68.9MB in the end (delta: -3.2MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2023-11-06 22:14:46,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.79ms. Allocated memory is still 90.2MB. Free memory was 68.9MB in the beginning and 65.2MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:14:46,082 INFO L158 Benchmark]: Boogie Preprocessor took 64.10ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 61.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:14:46,083 INFO L158 Benchmark]: RCFGBuilder took 1832.56ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 56.8MB in the end (delta: 4.3MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2023-11-06 22:14:46,083 INFO L158 Benchmark]: TraceAbstraction took 706.46ms. Allocated memory is still 90.2MB. Free memory was 56.1MB in the beginning and 62.3MB in the end (delta: -6.1MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2023-11-06 22:14:46,087 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.26ms. Allocated memory is still 60.8MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.81ms. Allocated memory is still 90.2MB. Free memory was 65.7MB in the beginning and 68.9MB in the end (delta: -3.2MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.79ms. Allocated memory is still 90.2MB. Free memory was 68.9MB in the beginning and 65.2MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.10ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 61.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1832.56ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 56.8MB in the end (delta: 4.3MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 706.46ms. Allocated memory is still 90.2MB. Free memory was 56.1MB in the beginning and 62.3MB in the end (delta: -6.1MB). Peak memory consumption was 28.9MB. 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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:14:46,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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_352cdedc-6b7e-4137-bd1d-49fc8617fa1b/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.