./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:45:13,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:45:13,272 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:45:13,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:45:13,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:45:13,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:45:13,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:45:13,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:45:13,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:45:13,336 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:45:13,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:45:13,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:45:13,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:45:13,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:45:13,340 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:45:13,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:45:13,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:45:13,341 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:45:13,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:45:13,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:45:13,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:45:13,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:45:13,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:45:13,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:45:13,348 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:45:13,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:45:13,349 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:45:13,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:45:13,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:45:13,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:45:13,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:45:13,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:45:13,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:45:13,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:45:13,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:45:13,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:45:13,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:45:13,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:45:13,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:45:13,356 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:45:13,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:45:13,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:45:13,357 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_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 [2023-11-26 10:45:13,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:45:13,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:45:13,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:45:13,684 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:45:13,684 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:45:13,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-11-26 10:45:17,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:45:17,370 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:45:17,372 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-11-26 10:45:17,387 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/data/e601c0487/8d70a39c66514e899182482adffd7b06/FLAG1806e7d47 [2023-11-26 10:45:17,413 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/data/e601c0487/8d70a39c66514e899182482adffd7b06 [2023-11-26 10:45:17,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:45:17,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:45:17,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:45:17,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:45:17,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:45:17,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:17,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82e155a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17, skipping insertion in model container [2023-11-26 10:45:17,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:17,486 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:45:17,717 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_e30d210a-e9f2-423b-b891-6e31d74c4a82/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2023-11-26 10:45:17,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:45:17,850 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:45:17,868 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_e30d210a-e9f2-423b-b891-6e31d74c4a82/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2023-11-26 10:45:17,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:45:17,990 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:45:17,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17 WrapperNode [2023-11-26 10:45:17,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:45:17,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:45:17,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:45:17,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:45:18,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,097 INFO L138 Inliner]: procedures = 29, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2023-11-26 10:45:18,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:45:18,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:45:18,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:45:18,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:45:18,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,147 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 18 writes are split as follows [0, 18]. [2023-11-26 10:45:18,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:45:18,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:45:18,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:45:18,197 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:45:18,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (1/1) ... [2023-11-26 10:45:18,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:45:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:18,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:45:18,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:45:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:45:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-26 10:45:18,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-26 10:45:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:45:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:45:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-26 10:45:18,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-26 10:45:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 10:45:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 10:45:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-26 10:45:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-26 10:45:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 10:45:18,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 10:45:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:45:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:45:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:45:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:45:18,463 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:45:18,475 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:45:19,181 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:45:19,239 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:45:19,239 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:45:19,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:45:19 BoogieIcfgContainer [2023-11-26 10:45:19,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:45:19,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:45:19,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:45:19,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:45:19,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:45:17" (1/3) ... [2023-11-26 10:45:19,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597826eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:45:19, skipping insertion in model container [2023-11-26 10:45:19,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:17" (2/3) ... [2023-11-26 10:45:19,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597826eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:45:19, skipping insertion in model container [2023-11-26 10:45:19,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:45:19" (3/3) ... [2023-11-26 10:45:19,251 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-36.i [2023-11-26 10:45:19,279 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:45:19,280 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:45:19,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:45:19,348 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2af27fd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:45:19,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:45:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 100 states have (on average 1.53) internal successors, (153), 101 states have internal predecessors, (153), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 10:45:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-26 10:45:19,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:19,374 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:19,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:19,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash 177960246, now seen corresponding path program 1 times [2023-11-26 10:45:19,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:19,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238560176] [2023-11-26 10:45:19,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 10:45:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-26 10:45:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:45:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:45:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:45:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:45:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 10:45:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:45:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 10:45:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 10:45:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 10:45:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:19,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238560176] [2023-11-26 10:45:19,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238560176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:19,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:19,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261600446] [2023-11-26 10:45:19,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:19,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:45:19,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:19,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:45:19,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:45:19,926 INFO L87 Difference]: Start difference. First operand has 114 states, 100 states have (on average 1.53) internal successors, (153), 101 states have internal predecessors, (153), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-26 10:45:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:20,007 INFO L93 Difference]: Finished difference Result 225 states and 359 transitions. [2023-11-26 10:45:20,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:45:20,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2023-11-26 10:45:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:20,020 INFO L225 Difference]: With dead ends: 225 [2023-11-26 10:45:20,020 INFO L226 Difference]: Without dead ends: 112 [2023-11-26 10:45:20,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-26 10:45:20,028 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 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-26 10:45:20,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:45:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-26 10:45:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-26 10:45:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.494949494949495) internal successors, (148), 99 states have internal predecessors, (148), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 10:45:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2023-11-26 10:45:20,080 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 104 [2023-11-26 10:45:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:20,081 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2023-11-26 10:45:20,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-26 10:45:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2023-11-26 10:45:20,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-26 10:45:20,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:20,088 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:20,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:45:20,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:20,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:20,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2013430972, now seen corresponding path program 1 times [2023-11-26 10:45:20,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:20,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52566739] [2023-11-26 10:45:20,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 10:45:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-26 10:45:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:45:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:45:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:45:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:45:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 10:45:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:45:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 10:45:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 10:45:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 10:45:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52566739] [2023-11-26 10:45:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52566739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:20,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:20,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:45:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209760070] [2023-11-26 10:45:20,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:20,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:45:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:20,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:45:20,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:45:20,553 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-26 10:45:20,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:20,685 INFO L93 Difference]: Finished difference Result 229 states and 348 transitions. [2023-11-26 10:45:20,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:20,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2023-11-26 10:45:20,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:20,689 INFO L225 Difference]: With dead ends: 229 [2023-11-26 10:45:20,690 INFO L226 Difference]: Without dead ends: 118 [2023-11-26 10:45:20,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:20,693 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 10 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:20,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 490 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:45:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-26 10:45:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2023-11-26 10:45:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.4851485148514851) internal successors, (150), 101 states have internal predecessors, (150), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 10:45:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2023-11-26 10:45:20,712 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 104 [2023-11-26 10:45:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:20,712 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2023-11-26 10:45:20,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-26 10:45:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2023-11-26 10:45:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-26 10:45:20,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:20,718 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:20,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:45:20,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:20,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1811607038, now seen corresponding path program 1 times [2023-11-26 10:45:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:20,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286471590] [2023-11-26 10:45:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 10:45:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-26 10:45:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:45:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:45:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:45:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:45:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 10:45:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:45:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 10:45:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 10:45:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 10:45:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:22,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286471590] [2023-11-26 10:45:22,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286471590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:22,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:22,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:45:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544625394] [2023-11-26 10:45:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:22,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:45:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:22,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:45:22,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:45:22,348 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:22,771 INFO L93 Difference]: Finished difference Result 341 states and 516 transitions. [2023-11-26 10:45:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:45:22,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2023-11-26 10:45:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:22,776 INFO L225 Difference]: With dead ends: 341 [2023-11-26 10:45:22,776 INFO L226 Difference]: Without dead ends: 228 [2023-11-26 10:45:22,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:22,779 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 117 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:22,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 250 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:45:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-11-26 10:45:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2023-11-26 10:45:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 199 states have (on average 1.4874371859296482) internal successors, (296), 199 states have internal predecessors, (296), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-26 10:45:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 340 transitions. [2023-11-26 10:45:22,811 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 340 transitions. Word has length 104 [2023-11-26 10:45:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:22,812 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 340 transitions. [2023-11-26 10:45:22,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 340 transitions. [2023-11-26 10:45:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-26 10:45:22,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:22,818 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:22,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:45:22,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:22,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:22,820 INFO L85 PathProgramCache]: Analyzing trace with hash 800489788, now seen corresponding path program 1 times [2023-11-26 10:45:22,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:22,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230211031] [2023-11-26 10:45:22,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 10:45:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-26 10:45:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:45:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:45:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:45:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:45:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 10:45:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:45:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 10:45:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 10:45:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 10:45:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:24,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:24,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230211031] [2023-11-26 10:45:24,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230211031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:24,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:24,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:45:24,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406423759] [2023-11-26 10:45:24,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:24,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:45:24,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:24,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:45:24,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:45:24,119 INFO L87 Difference]: Start difference. First operand 224 states and 340 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:24,540 INFO L93 Difference]: Finished difference Result 500 states and 759 transitions. [2023-11-26 10:45:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2023-11-26 10:45:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:24,544 INFO L225 Difference]: With dead ends: 500 [2023-11-26 10:45:24,544 INFO L226 Difference]: Without dead ends: 277 [2023-11-26 10:45:24,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:24,547 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 206 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:24,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 287 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:45:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-11-26 10:45:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 225. [2023-11-26 10:45:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.485) internal successors, (297), 200 states have internal predecessors, (297), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-26 10:45:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 341 transitions. [2023-11-26 10:45:24,585 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 341 transitions. Word has length 104 [2023-11-26 10:45:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:24,586 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 341 transitions. [2023-11-26 10:45:24,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 341 transitions. [2023-11-26 10:45:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-26 10:45:24,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:24,590 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:24,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:45:24,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:24,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:24,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1501554366, now seen corresponding path program 1 times [2023-11-26 10:45:24,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:24,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905147970] [2023-11-26 10:45:24,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:24,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 10:45:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-26 10:45:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:45:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:45:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:45:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:45:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 10:45:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:45:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 10:45:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 10:45:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 10:45:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:24,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:24,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905147970] [2023-11-26 10:45:24,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905147970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:24,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:24,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:45:24,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903176708] [2023-11-26 10:45:24,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:24,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:45:24,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:24,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:45:24,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:45:24,891 INFO L87 Difference]: Start difference. First operand 225 states and 341 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:25,269 INFO L93 Difference]: Finished difference Result 619 states and 940 transitions. [2023-11-26 10:45:25,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:45:25,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2023-11-26 10:45:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:25,274 INFO L225 Difference]: With dead ends: 619 [2023-11-26 10:45:25,274 INFO L226 Difference]: Without dead ends: 395 [2023-11-26 10:45:25,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:25,277 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 174 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:25,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 367 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:45:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2023-11-26 10:45:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 345. [2023-11-26 10:45:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 308 states have (on average 1.4870129870129871) internal successors, (458), 308 states have internal predecessors, (458), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-26 10:45:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 524 transitions. [2023-11-26 10:45:25,308 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 524 transitions. Word has length 104 [2023-11-26 10:45:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:25,309 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 524 transitions. [2023-11-26 10:45:25,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 524 transitions. [2023-11-26 10:45:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-26 10:45:25,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:25,312 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:25,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:45:25,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:25,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:25,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1924256192, now seen corresponding path program 1 times [2023-11-26 10:45:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:25,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752964570] [2023-11-26 10:45:25,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:25,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 10:45:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-26 10:45:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:45:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:45:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:45:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:45:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 10:45:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:45:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 10:45:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 10:45:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 10:45:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:26,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752964570] [2023-11-26 10:45:26,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752964570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:26,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:26,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:45:26,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250422763] [2023-11-26 10:45:26,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:26,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:45:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:45:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:45:26,085 INFO L87 Difference]: Start difference. First operand 345 states and 524 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:27,188 INFO L93 Difference]: Finished difference Result 1150 states and 1747 transitions. [2023-11-26 10:45:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:45:27,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2023-11-26 10:45:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:27,196 INFO L225 Difference]: With dead ends: 1150 [2023-11-26 10:45:27,196 INFO L226 Difference]: Without dead ends: 926 [2023-11-26 10:45:27,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:45:27,198 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 492 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:27,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 776 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-26 10:45:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2023-11-26 10:45:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 423. [2023-11-26 10:45:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 386 states have (on average 1.5025906735751295) internal successors, (580), 386 states have internal predecessors, (580), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-26 10:45:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 646 transitions. [2023-11-26 10:45:27,240 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 646 transitions. Word has length 104 [2023-11-26 10:45:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:27,241 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 646 transitions. [2023-11-26 10:45:27,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:27,241 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 646 transitions. [2023-11-26 10:45:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-26 10:45:27,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:27,243 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:27,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:45:27,243 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:27,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1802165912, now seen corresponding path program 1 times [2023-11-26 10:45:27,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:27,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158493351] [2023-11-26 10:45:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:27,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 10:45:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-26 10:45:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:45:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:45:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:45:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:45:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 10:45:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:45:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 10:45:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 10:45:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 10:45:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:28,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:28,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158493351] [2023-11-26 10:45:28,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158493351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:28,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:28,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:45:28,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982307883] [2023-11-26 10:45:28,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:28,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:45:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:28,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:45:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:45:28,321 INFO L87 Difference]: Start difference. First operand 423 states and 646 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-26 10:45:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:29,185 INFO L93 Difference]: Finished difference Result 960 states and 1459 transitions. [2023-11-26 10:45:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-26 10:45:29,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2023-11-26 10:45:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:29,191 INFO L225 Difference]: With dead ends: 960 [2023-11-26 10:45:29,192 INFO L226 Difference]: Without dead ends: 697 [2023-11-26 10:45:29,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-26 10:45:29,194 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 231 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:29,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 670 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 10:45:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2023-11-26 10:45:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 365. [2023-11-26 10:45:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 328 states have (on average 1.4817073170731707) internal successors, (486), 328 states have internal predecessors, (486), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-26 10:45:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2023-11-26 10:45:29,250 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 106 [2023-11-26 10:45:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:29,251 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2023-11-26 10:45:29,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-26 10:45:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2023-11-26 10:45:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-26 10:45:29,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:29,253 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:29,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:45:29,254 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:29,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash 390126803, now seen corresponding path program 1 times [2023-11-26 10:45:29,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:29,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099478441] [2023-11-26 10:45:29,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:29,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-26 10:45:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-26 10:45:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-26 10:45:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 10:45:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 10:45:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 10:45:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 10:45:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:45:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 10:45:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 10:45:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 10:45:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:29,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099478441] [2023-11-26 10:45:29,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099478441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:29,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:29,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:45:29,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589227684] [2023-11-26 10:45:29,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:29,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:45:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:29,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:45:29,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:29,474 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:29,556 INFO L93 Difference]: Finished difference Result 635 states and 960 transitions. [2023-11-26 10:45:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:45:29,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2023-11-26 10:45:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:29,560 INFO L225 Difference]: With dead ends: 635 [2023-11-26 10:45:29,561 INFO L226 Difference]: Without dead ends: 401 [2023-11-26 10:45:29,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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-26 10:45:29,563 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 77 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:29,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 648 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:45:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-11-26 10:45:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 371. [2023-11-26 10:45:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 334 states have (on average 1.473053892215569) internal successors, (492), 334 states have internal predecessors, (492), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-26 10:45:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 558 transitions. [2023-11-26 10:45:29,601 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 558 transitions. Word has length 107 [2023-11-26 10:45:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:29,601 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 558 transitions. [2023-11-26 10:45:29,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 558 transitions. [2023-11-26 10:45:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-26 10:45:29,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:29,605 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:29,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:45:29,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:29,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1593916652, now seen corresponding path program 1 times [2023-11-26 10:45:29,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:29,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726370349] [2023-11-26 10:45:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:29,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:45:29,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:45:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:45:29,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:45:29,794 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:45:29,796 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 10:45:29,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:45:29,804 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:29,808 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:45:29,873 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-26 10:45:29,874 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated [2023-11-26 10:45:29,874 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-26 10:45:29,875 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated [2023-11-26 10:45:29,875 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated [2023-11-26 10:45:29,875 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-26 10:45:29,875 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated [2023-11-26 10:45:29,876 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated [2023-11-26 10:45:29,876 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated [2023-11-26 10:45:29,876 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated [2023-11-26 10:45:29,877 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-26 10:45:29,877 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-11-26 10:45:29,878 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated [2023-11-26 10:45:29,878 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-11-26 10:45:29,879 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-26 10:45:29,879 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-11-26 10:45:29,879 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short58 could not be translated [2023-11-26 10:45:29,879 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-11-26 10:45:29,880 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short62 could not be translated [2023-11-26 10:45:29,880 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-26 10:45:29,880 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short62 could not be translated [2023-11-26 10:45:29,881 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-11-26 10:45:29,881 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short58 could not be translated [2023-11-26 10:45:29,881 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-26 10:45:29,882 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-11-26 10:45:29,882 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-11-26 10:45:29,883 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-26 10:45:29,883 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-26 10:45:29,883 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-26 10:45:29,884 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-26 10:45:29,884 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated [2023-11-26 10:45:29,884 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-26 10:45:29,884 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated [2023-11-26 10:45:29,885 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-26 10:45:29,885 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated [2023-11-26 10:45:29,885 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated [2023-11-26 10:45:29,886 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-26 10:45:29,886 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-11-26 10:45:29,886 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-11-26 10:45:29,886 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-11-26 10:45:29,887 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short77 could not be translated [2023-11-26 10:45:29,887 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-11-26 10:45:29,887 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-11-26 10:45:29,887 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short81 could not be translated [2023-11-26 10:45:29,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short77 could not be translated [2023-11-26 10:45:29,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short81 could not be translated [2023-11-26 10:45:29,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-11-26 10:45:29,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-11-26 10:45:29,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-26 10:45:29,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-26 10:45:29,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-26 10:45:29,890 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-26 10:45:29,890 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-26 10:45:29,890 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-26 10:45:29,890 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short85 could not be translated [2023-11-26 10:45:29,891 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-26 10:45:29,891 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-26 10:45:29,892 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-26 10:45:29,892 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short85 could not be translated [2023-11-26 10:45:29,892 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated [2023-11-26 10:45:29,893 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated [2023-11-26 10:45:29,893 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 10:45:29,894 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated [2023-11-26 10:45:29,894 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated [2023-11-26 10:45:29,895 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-26 10:45:29,895 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-26 10:45:29,895 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-11-26 10:45:29,895 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite38 could not be translated [2023-11-26 10:45:29,896 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-26 10:45:29,896 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-26 10:45:29,896 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-26 10:45:29,897 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-26 10:45:29,897 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short97 could not be translated [2023-11-26 10:45:29,897 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite114 could not be translated [2023-11-26 10:45:29,897 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-26 10:45:29,898 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-26 10:45:29,898 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated [2023-11-26 10:45:29,898 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-26 10:45:29,898 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-26 10:45:29,899 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite114 could not be translated [2023-11-26 10:45:29,899 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-26 10:45:29,899 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short121 could not be translated [2023-11-26 10:45:29,899 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short97 could not be translated [2023-11-26 10:45:29,899 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated [2023-11-26 10:45:29,900 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated [2023-11-26 10:45:29,900 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short121 could not be translated [2023-11-26 10:45:29,900 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short97 could not be translated [2023-11-26 10:45:29,900 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-26 10:45:29,900 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite114 could not be translated [2023-11-26 10:45:29,901 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated [2023-11-26 10:45:29,901 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-26 10:45:29,901 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-26 10:45:29,901 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short121 could not be translated [2023-11-26 10:45:29,901 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-26 10:45:29,902 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short153 could not be translated [2023-11-26 10:45:29,902 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-26 10:45:29,902 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated [2023-11-26 10:45:29,902 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-26 10:45:29,902 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated [2023-11-26 10:45:29,903 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short97 could not be translated [2023-11-26 10:45:29,903 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite114 could not be translated [2023-11-26 10:45:29,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:45:29 BoogieIcfgContainer [2023-11-26 10:45:29,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:45:29,922 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:45:29,922 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:45:29,922 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:45:29,923 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:45:19" (3/4) ... [2023-11-26 10:45:29,925 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:45:29,926 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:45:29,927 INFO L158 Benchmark]: Toolchain (without parser) took 12505.74ms. Allocated memory was 151.0MB in the beginning and 276.8MB in the end (delta: 125.8MB). Free memory was 113.5MB in the beginning and 131.8MB in the end (delta: -18.3MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. [2023-11-26 10:45:29,927 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 104.9MB. Free memory was 53.1MB in the beginning and 52.9MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:45:29,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.97ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 97.7MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 10:45:29,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.79ms. Allocated memory is still 151.0MB. Free memory was 97.7MB in the beginning and 93.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:45:29,928 INFO L158 Benchmark]: Boogie Preprocessor took 97.74ms. Allocated memory is still 151.0MB. Free memory was 93.6MB in the beginning and 88.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:45:29,928 INFO L158 Benchmark]: RCFGBuilder took 1043.76ms. Allocated memory is still 151.0MB. Free memory was 88.6MB in the beginning and 98.9MB in the end (delta: -10.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-11-26 10:45:29,929 INFO L158 Benchmark]: TraceAbstraction took 10678.47ms. Allocated memory was 151.0MB in the beginning and 276.8MB in the end (delta: 125.8MB). Free memory was 97.9MB in the beginning and 131.8MB in the end (delta: -33.9MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2023-11-26 10:45:29,929 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 276.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:45:29,931 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.33ms. Allocated memory is still 104.9MB. Free memory was 53.1MB in the beginning and 52.9MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.97ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 97.7MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.79ms. Allocated memory is still 151.0MB. Free memory was 97.7MB in the beginning and 93.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.74ms. Allocated memory is still 151.0MB. Free memory was 93.6MB in the beginning and 88.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1043.76ms. Allocated memory is still 151.0MB. Free memory was 88.6MB in the beginning and 98.9MB in the end (delta: -10.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10678.47ms. Allocated memory was 151.0MB in the beginning and 276.8MB in the end (delta: 125.8MB). Free memory was 97.9MB in the beginning and 131.8MB in the end (delta: -33.9MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 276.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short77 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short77 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem92 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short121 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short153 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite114 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of shiftRight at line 55. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L51] unsigned char last_1_WrapperStruct00_var_1_14 = 1; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] EXPR WrapperStruct00.var_1_14 [L109] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L88] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L89] EXPR WrapperStruct00.var_1_3 [L89] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_3 [L89] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L98] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_11 [L99] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_11 [L99] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L100] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L104] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L120] RET updateVariables() [L121] CALL step() [L55] EXPR last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L55] COND FALSE !((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) [L58] EXPR WrapperStruct00.var_1_13 [L58] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L58] COND FALSE !(WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) [L65] WrapperStruct00.var_1_14 = 0 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L67] EXPR WrapperStruct00.var_1_5 [L67] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L67] COND TRUE WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3 [L68] WrapperStruct00.var_1_10 = 4.6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L72] EXPR WrapperStruct00.var_1_10 [L72] EXPR WrapperStruct00.var_1_10 [L72] unsigned char stepLocal_0 = WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10; [L73] stepLocal_0 && WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L73] stepLocal_0 && WrapperStruct00.var_1_7 [L73] EXPR WrapperStruct00.var_1_7 [L73] stepLocal_0 && WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L73] COND TRUE stepLocal_0 && WrapperStruct00.var_1_7 [L74] EXPR WrapperStruct00.var_1_10 [L74] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L74] EXPR ((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)) [L74] EXPR WrapperStruct00.var_1_10 [L74] EXPR ((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L74] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L74] COND TRUE ((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10 [L75] WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L75] COND TRUE WrapperStruct00.var_1_7 [L76] WrapperStruct00.var_1_1 = 10u VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR WrapperStruct00.var_1_10 [L112] EXPR WrapperStruct00.var_1_10 [L112] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14)) [L112] EXPR WrapperStruct00.var_1_1 [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR ((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR ((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112-L113] return (((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0))) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_14=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1309 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1307 mSDsluCounter, 3654 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2526 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1841 IncrementalHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 1128 mSDtfsCounter, 1841 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 975 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 1977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 1760/1760 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-26 10:45:29,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:45:32,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:45:32,889 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 10:45:32,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:45:32,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:45:32,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:45:32,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:45:32,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:45:32,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:45:32,954 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:45:32,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:45:32,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:45:32,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:45:32,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:45:32,958 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:45:32,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:45:32,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:45:32,959 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:45:32,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:45:32,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:45:32,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:45:32,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:45:32,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:45:32,963 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:45:32,963 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 10:45:32,964 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 10:45:32,964 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:45:32,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:45:32,965 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:45:32,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:45:32,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:45:32,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:45:32,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:45:32,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:45:32,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:45:32,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:45:32,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:45:32,970 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 10:45:32,970 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 10:45:32,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:45:32,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:45:32,971 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:45:32,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:45:32,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:45:32,972 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 10:45:32,972 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_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 [2023-11-26 10:45:33,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:45:33,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:45:33,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:45:33,388 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:45:33,388 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:45:33,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-11-26 10:45:36,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:45:36,804 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:45:36,805 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-11-26 10:45:36,818 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/data/88c13c1e3/ebf8f0d61c8346f7a12bc0b02ce90799/FLAGceef03fa4 [2023-11-26 10:45:36,833 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/data/88c13c1e3/ebf8f0d61c8346f7a12bc0b02ce90799 [2023-11-26 10:45:36,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:45:36,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:45:36,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:45:36,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:45:36,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:45:36,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:45:36" (1/1) ... [2023-11-26 10:45:36,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df39d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:36, skipping insertion in model container [2023-11-26 10:45:36,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:45:36" (1/1) ... [2023-11-26 10:45:36,881 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:45:37,033 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_e30d210a-e9f2-423b-b891-6e31d74c4a82/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2023-11-26 10:45:37,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:45:37,112 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:45:37,126 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_e30d210a-e9f2-423b-b891-6e31d74c4a82/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2023-11-26 10:45:37,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:45:37,199 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:45:37,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37 WrapperNode [2023-11-26 10:45:37,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:45:37,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:45:37,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:45:37,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:45:37,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,275 INFO L138 Inliner]: procedures = 36, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2023-11-26 10:45:37,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:45:37,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:45:37,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:45:37,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:45:37,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,334 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 18 writes are split as follows [0, 18]. [2023-11-26 10:45:37,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:45:37,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:45:37,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:45:37,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:45:37,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (1/1) ... [2023-11-26 10:45:37,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:45:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:37,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:45:37,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:45:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:45:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-26 10:45:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-26 10:45:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-26 10:45:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-26 10:45:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-26 10:45:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-26 10:45:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 10:45:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 10:45:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-26 10:45:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-26 10:45:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-11-26 10:45:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-11-26 10:45:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-11-26 10:45:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-11-26 10:45:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-26 10:45:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-26 10:45:37,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-11-26 10:45:37,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-11-26 10:45:37,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-11-26 10:45:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-11-26 10:45:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 10:45:37,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 10:45:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:45:37,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:45:37,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-26 10:45:37,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-26 10:45:37,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 10:45:37,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 10:45:37,793 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:45:37,795 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:45:38,937 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:45:38,987 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:45:38,987 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:45:38,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:45:38 BoogieIcfgContainer [2023-11-26 10:45:38,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:45:38,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:45:38,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:45:38,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:45:38,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:45:36" (1/3) ... [2023-11-26 10:45:38,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39786f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:45:38, skipping insertion in model container [2023-11-26 10:45:38,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:37" (2/3) ... [2023-11-26 10:45:38,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39786f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:45:38, skipping insertion in model container [2023-11-26 10:45:38,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:45:38" (3/3) ... [2023-11-26 10:45:38,998 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-36.i [2023-11-26 10:45:39,019 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:45:39,019 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:45:39,070 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:45:39,076 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29714631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:45:39,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:45:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 10:45:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-26 10:45:39,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:39,096 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:39,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:39,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1440714402, now seen corresponding path program 1 times [2023-11-26 10:45:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:45:39,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427600586] [2023-11-26 10:45:39,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:39,120 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-26 10:45:39,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:45:39,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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-26 10:45:39,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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-26 10:45:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:39,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 10:45:39,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-26 10:45:39,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:45:39,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:45:39,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427600586] [2023-11-26 10:45:39,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427600586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:39,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:39,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036935389] [2023-11-26 10:45:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:39,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:45:39,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:45:39,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:45:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:45:39,636 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-26 10:45:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:39,694 INFO L93 Difference]: Finished difference Result 217 states and 345 transitions. [2023-11-26 10:45:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:45:39,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2023-11-26 10:45:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:39,706 INFO L225 Difference]: With dead ends: 217 [2023-11-26 10:45:39,706 INFO L226 Difference]: Without dead ends: 106 [2023-11-26 10:45:39,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-26 10:45:39,715 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 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-26 10:45:39,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:45:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-26 10:45:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-26 10:45:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 10:45:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2023-11-26 10:45:39,767 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 103 [2023-11-26 10:45:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:39,768 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2023-11-26 10:45:39,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-26 10:45:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2023-11-26 10:45:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-26 10:45:39,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:39,773 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:39,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-26 10:45:39,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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-26 10:45:39,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:39,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash -411674344, now seen corresponding path program 1 times [2023-11-26 10:45:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:45:39,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116065521] [2023-11-26 10:45:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:39,986 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-26 10:45:39,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:45:39,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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-26 10:45:40,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 10:45:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:40,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:45:40,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-26 10:45:40,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:45:40,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:45:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116065521] [2023-11-26 10:45:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116065521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:40,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:40,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:45:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534461074] [2023-11-26 10:45:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:40,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:45:40,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:45:40,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:45:40,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:45:40,448 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-26 10:45:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:40,623 INFO L93 Difference]: Finished difference Result 217 states and 324 transitions. [2023-11-26 10:45:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2023-11-26 10:45:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:40,626 INFO L225 Difference]: With dead ends: 217 [2023-11-26 10:45:40,626 INFO L226 Difference]: Without dead ends: 112 [2023-11-26 10:45:40,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:40,657 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 10 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:40,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 454 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:45:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-26 10:45:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2023-11-26 10:45:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 10:45:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2023-11-26 10:45:40,682 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 103 [2023-11-26 10:45:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:40,683 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2023-11-26 10:45:40,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-26 10:45:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2023-11-26 10:45:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-26 10:45:40,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:40,686 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:40,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-26 10:45:40,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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-26 10:45:40,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:40,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash -972374122, now seen corresponding path program 1 times [2023-11-26 10:45:40,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:45:40,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47481432] [2023-11-26 10:45:40,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:40,890 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-26 10:45:40,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:45:40,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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-26 10:45:40,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-26 10:45:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:41,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:45:41,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:41,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:45:41,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 64 [2023-11-26 10:45:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:41,446 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:45:41,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:45:41,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47481432] [2023-11-26 10:45:41,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47481432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:41,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:41,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:45:41,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141355694] [2023-11-26 10:45:41,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:41,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:45:41,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:41,454 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:41,537 INFO L93 Difference]: Finished difference Result 211 states and 312 transitions. [2023-11-26 10:45:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2023-11-26 10:45:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:41,541 INFO L225 Difference]: With dead ends: 211 [2023-11-26 10:45:41,544 INFO L226 Difference]: Without dead ends: 104 [2023-11-26 10:45:41,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-26 10:45:41,547 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:41,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:45:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-26 10:45:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-26 10:45:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 10:45:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2023-11-26 10:45:41,565 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 103 [2023-11-26 10:45:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:41,566 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2023-11-26 10:45:41,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2023-11-26 10:45:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-26 10:45:41,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:41,570 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:41,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-26 10:45:41,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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-26 10:45:41,779 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:41,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1983491372, now seen corresponding path program 1 times [2023-11-26 10:45:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:45:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217165640] [2023-11-26 10:45:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:41,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 10:45:41,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:45:41,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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-26 10:45:41,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-26 10:45:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:42,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:45:42,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:42,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:45:42,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:45:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217165640] [2023-11-26 10:45:42,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217165640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:42,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:42,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:45:42,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401403404] [2023-11-26 10:45:42,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:42,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:42,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:45:42,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:42,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:42,212 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:42,248 INFO L93 Difference]: Finished difference Result 201 states and 292 transitions. [2023-11-26 10:45:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:42,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2023-11-26 10:45:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:42,254 INFO L225 Difference]: With dead ends: 201 [2023-11-26 10:45:42,254 INFO L226 Difference]: Without dead ends: 98 [2023-11-26 10:45:42,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-26 10:45:42,259 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 32 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:42,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 233 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:45:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-26 10:45:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-26 10:45:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-26 10:45:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2023-11-26 10:45:42,277 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 103 [2023-11-26 10:45:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:42,278 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2023-11-26 10:45:42,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2023-11-26 10:45:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-26 10:45:42,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:42,281 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 10:45:42,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-26 10:45:42,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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-26 10:45:42,490 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:45:42,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:42,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1282426794, now seen corresponding path program 1 times [2023-11-26 10:45:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:45:42,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555609465] [2023-11-26 10:45:42,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:42,492 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-26 10:45:42,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:45:42,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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-26 10:45:42,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d210a-e9f2-423b-b891-6e31d74c4a82/bin/uautomizer-verify-VRDe98Ueme/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 (6)] Waiting until timeout for monitored process [2023-11-26 10:45:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:42,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-26 10:45:42,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:42,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-26 10:45:42,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2023-11-26 10:45:47,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:45:47,133 INFO L378 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-26 10:45:47,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 10:45:47,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 39 [2023-11-26 10:45:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-26 10:45:47,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:45:47,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:45:47,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555609465] [2023-11-26 10:45:47,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555609465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:47,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:47,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:45:47,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002236907] [2023-11-26 10:45:47,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:47,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:45:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:45:47,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:45:47,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=27, Unknown=1, NotChecked=0, Total=42 [2023-11-26 10:45:47,421 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-26 10:45:51,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 10:45:56,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 10:46:00,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 10:46:04,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-26 10:46:08,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]