./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu --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 7fd36b961a9568d61d1e2740d3df2c3ef998c6b657eefe353ce47ee368fc6b64 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:47:46,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:47:46,363 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:47:46,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:47:46,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:47:46,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:47:46,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:47:46,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:47:46,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:47:46,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:47:46,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:47:46,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:47:46,403 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:47:46,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:47:46,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:47:46,405 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:47:46,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:47:46,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:47:46,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:47:46,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:47:46,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:47:46,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:47:46,410 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:47:46,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:47:46,411 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:47:46,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:47:46,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:47:46,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:47:46,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:46,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:47:46,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:47:46,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:47:46,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:47:46,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:47:46,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:47:46,416 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:47:46,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:47:46,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:47:46,417 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:47:46,417 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_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/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_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu 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 -> 7fd36b961a9568d61d1e2740d3df2c3ef998c6b657eefe353ce47ee368fc6b64 [2023-11-19 07:47:46,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:47:46,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:47:46,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:47:46,725 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:47:46,725 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:47:46,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i [2023-11-19 07:47:50,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:47:50,636 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:47:50,637 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i [2023-11-19 07:47:50,652 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/data/110b36066/17f1e168985a4ee6a9ea20f905681e88/FLAGd8ef816f3 [2023-11-19 07:47:50,671 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/data/110b36066/17f1e168985a4ee6a9ea20f905681e88 [2023-11-19 07:47:50,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:47:50,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:47:50,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:50,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:47:50,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:47:50,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:50" (1/1) ... [2023-11-19 07:47:50,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5695de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:50, skipping insertion in model container [2023-11-19 07:47:50,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:50" (1/1) ... [2023-11-19 07:47:50,734 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:47:50,951 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_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i[917,930] [2023-11-19 07:47:51,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:51,058 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:47:51,070 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_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-84.i[917,930] [2023-11-19 07:47:51,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:51,139 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:47:51,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51 WrapperNode [2023-11-19 07:47:51,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:51,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:51,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:47:51,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:47:51,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,266 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 398 [2023-11-19 07:47:51,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:51,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:47:51,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:47:51,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:47:51,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:47:51,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:47:51,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:47:51,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:47:51,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (1/1) ... [2023-11-19 07:47:51,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:51,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:51,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:47:51,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:47:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:47:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:47:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:47:51,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:47:51,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:47:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:47:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:47:51,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:47:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:47:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:47:51,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:47:51,689 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:47:51,692 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:47:52,420 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:47:52,440 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:47:52,444 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:47:52,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:52 BoogieIcfgContainer [2023-11-19 07:47:52,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:47:52,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:47:52,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:47:52,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:47:52,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:47:50" (1/3) ... [2023-11-19 07:47:52,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644c3e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:52, skipping insertion in model container [2023-11-19 07:47:52,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:51" (2/3) ... [2023-11-19 07:47:52,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644c3e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:52, skipping insertion in model container [2023-11-19 07:47:52,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:52" (3/3) ... [2023-11-19 07:47:52,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-84.i [2023-11-19 07:47:52,495 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:47:52,495 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:47:52,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:47:52,595 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;@79000faf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:47:52,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:47:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-19 07:47:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-19 07:47:52,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:52,630 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:47:52,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:52,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1017449549, now seen corresponding path program 1 times [2023-11-19 07:47:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251374357] [2023-11-19 07:47:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:52,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:47:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:47:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:47:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:47:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:47:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:47:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:47:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:47:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:47:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:47:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:47:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:47:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:47:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:47:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:47:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:47:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:47:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:47:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:47:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:47:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251374357] [2023-11-19 07:47:53,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251374357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:53,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:53,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:47:53,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822354607] [2023-11-19 07:47:53,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:53,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:47:53,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:53,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:47:53,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:47:53,351 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:47:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:53,398 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2023-11-19 07:47:53,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:47:53,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2023-11-19 07:47:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:53,409 INFO L225 Difference]: With dead ends: 199 [2023-11-19 07:47:53,409 INFO L226 Difference]: Without dead ends: 99 [2023-11-19 07:47:53,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-19 07:47:53,418 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:53,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:47:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-19 07:47:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-19 07:47:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-19 07:47:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-11-19 07:47:53,494 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2023-11-19 07:47:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:53,495 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-11-19 07:47:53,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:47:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-11-19 07:47:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-19 07:47:53,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:53,503 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:47:53,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:47:53,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:53,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash 695807149, now seen corresponding path program 1 times [2023-11-19 07:47:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:53,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527924065] [2023-11-19 07:47:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:47:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:47:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:47:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:47:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:47:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:47:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:47:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:47:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:47:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:47:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:47:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:47:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:47:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:47:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:47:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:47:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:47:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:47:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:47:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:47:54,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:54,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527924065] [2023-11-19 07:47:54,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527924065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:54,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:54,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:54,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323961573] [2023-11-19 07:47:54,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:54,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:54,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:54,055 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:47:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:54,150 INFO L93 Difference]: Finished difference Result 199 states and 284 transitions. [2023-11-19 07:47:54,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:47:54,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-19 07:47:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:54,155 INFO L225 Difference]: With dead ends: 199 [2023-11-19 07:47:54,156 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 07:47:54,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-19 07:47:54,159 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 3 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:54,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:47:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 07:47:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2023-11-19 07:47:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-19 07:47:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-11-19 07:47:54,199 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 150 [2023-11-19 07:47:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:54,203 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-11-19 07:47:54,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:47:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-11-19 07:47:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-19 07:47:54,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:54,209 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:47:54,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:47:54,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:54,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:54,210 INFO L85 PathProgramCache]: Analyzing trace with hash 697654191, now seen corresponding path program 1 times [2023-11-19 07:47:54,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:54,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006365324] [2023-11-19 07:47:54,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:47:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:47:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:47:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:47:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:47:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:47:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:47:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:47:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:47:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:47:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:47:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:47:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:47:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:47:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:47:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:47:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:47:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:47:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:47:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:47:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:47:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006365324] [2023-11-19 07:47:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006365324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:54,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:54,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:47:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784347699] [2023-11-19 07:47:55,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:55,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:47:55,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:55,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:47:55,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:55,007 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:47:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:55,646 INFO L93 Difference]: Finished difference Result 300 states and 427 transitions. [2023-11-19 07:47:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:47:55,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-19 07:47:55,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:55,651 INFO L225 Difference]: With dead ends: 300 [2023-11-19 07:47:55,651 INFO L226 Difference]: Without dead ends: 202 [2023-11-19 07:47:55,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:55,655 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 135 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:55,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 476 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:47:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-19 07:47:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 169. [2023-11-19 07:47:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 126 states have internal predecessors, (160), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:47:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2023-11-19 07:47:55,700 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 150 [2023-11-19 07:47:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:55,702 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2023-11-19 07:47:55,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:47:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2023-11-19 07:47:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-19 07:47:55,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:55,708 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:47:55,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:47:55,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:55,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -233272627, now seen corresponding path program 1 times [2023-11-19 07:47:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:55,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138670511] [2023-11-19 07:47:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:48:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:48:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:48:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:48:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:48:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:48:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:48:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:48:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:48:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:48:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:48:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:48:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:48:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:48:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:48:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:48:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:48:00,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:00,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138670511] [2023-11-19 07:48:00,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138670511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-19 07:48:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935436190] [2023-11-19 07:48:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:00,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 07:48:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:00,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 07:48:00,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:48:00,872 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:48:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:04,357 INFO L93 Difference]: Finished difference Result 358 states and 507 transitions. [2023-11-19 07:48:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:48:04,358 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2023-11-19 07:48:04,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:04,363 INFO L225 Difference]: With dead ends: 358 [2023-11-19 07:48:04,363 INFO L226 Difference]: Without dead ends: 260 [2023-11-19 07:48:04,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2023-11-19 07:48:04,367 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 338 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:04,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 824 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-19 07:48:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-19 07:48:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 195. [2023-11-19 07:48:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 152 states have internal predecessors, (197), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:48:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2023-11-19 07:48:04,438 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 158 [2023-11-19 07:48:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:04,440 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2023-11-19 07:48:04,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:48:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2023-11-19 07:48:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-19 07:48:04,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:04,445 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:48:04,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:48:04,445 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:04,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash -652429390, now seen corresponding path program 1 times [2023-11-19 07:48:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098085260] [2023-11-19 07:48:04,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:04,508 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-19 07:48:04,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [145593172] [2023-11-19 07:48:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:04,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:04,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:04,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:48:04,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:48:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:05,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 86 conjunts are in the unsatisfiable core [2023-11-19 07:48:05,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:48:08,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:48:09,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:48:09,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:48:10,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:48:10,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:48:11,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 07:48:12,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2023-11-19 07:48:12,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:12,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-19 07:48:12,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-19 07:48:12,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:12,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:12,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-19 07:48:12,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:12,805 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:48:12,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2023-11-19 07:48:13,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2023-11-19 07:48:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 317 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2023-11-19 07:48:13,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:48:13,364 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_357))) (= (mod (+ (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) 256) (mod (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256)))) is different from false [2023-11-19 07:48:13,477 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_356))) (or (let ((.cse0 (store .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_357))) (= (mod (+ (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset)) 256) (mod (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256))) (< (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset) (+ (mod (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256) 1))))) is different from false [2023-11-19 07:48:13,505 WARN L854 $PredicateComparison]: unable to prove that (forall ((~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select |c_#memory_int| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset 24)) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_356))) (or (< (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset) (+ (mod (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256) 1)) (let ((.cse1 (store .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_357))) (= (mod (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256) (mod (+ (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) 256)))))) is different from false [2023-11-19 07:48:13,553 WARN L854 $PredicateComparison]: unable to prove that (forall ((~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset Int) (v_ArrVal_354 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_354))) (store .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset 24))) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_356))) (or (< (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset) (+ (mod (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256) 1)) (let ((.cse1 (store .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_357))) (= (mod (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256) (mod (+ (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) 256)))))) is different from false [2023-11-19 07:48:13,609 WARN L854 $PredicateComparison]: unable to prove that (forall ((~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset Int) (v_ArrVal_354 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (store (let ((.cse2 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset (+ (mod |c_ULTIMATE.start_step_#t~mem17#1| 256) |c_ULTIMATE.start_step_#t~ite16#1|))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_354))) (store .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset 24))) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_356))) (or (< (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset) (+ (mod (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256) 1)) (let ((.cse1 (store .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_357))) (= (mod (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256) (mod (+ (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) 256)))))) is different from false [2023-11-19 07:48:13,646 WARN L854 $PredicateComparison]: unable to prove that (forall ((~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset Int) (v_ArrVal_354 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (store (let ((.cse2 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset (+ (mod |c_ULTIMATE.start_step_#t~mem17#1| 256) (mod (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) 256)))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_354))) (store .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset 24))) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_356))) (or (< (select (select .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset) (+ (mod (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256) 1)) (let ((.cse1 (store .cse0 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_357))) (= (mod (+ (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) 256) (mod (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256)))))) is different from false [2023-11-19 07:48:13,751 WARN L854 $PredicateComparison]: unable to prove that (forall ((~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset Int) (v_ArrVal_354 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base (store (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset (+ (mod (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) 256) (mod (select (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset) 256)))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_354))) (store .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base (store (select .cse2 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset 24))) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_356))) (or (let ((.cse0 (store .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_357))) (= (mod (+ (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0.offset) (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer~0.offset)) 256) (mod (select (select .cse0 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256))) (< (select (select .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.base) ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0.offset) (+ (mod (select (select .cse1 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.base) c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var6_Pointer~0.offset) 256) 1))))) is different from false [2023-11-19 07:48:13,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098085260] [2023-11-19 07:48:13,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-19 07:48:13,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145593172] [2023-11-19 07:48:13,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145593172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:13,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:48:13,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2023-11-19 07:48:13,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088257984] [2023-11-19 07:48:13,840 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-19 07:48:13,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 07:48:13,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:13,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 07:48:13,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=484, Unknown=7, NotChecked=350, Total=930 [2023-11-19 07:48:13,843 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:48:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:19,208 INFO L93 Difference]: Finished difference Result 544 states and 758 transitions. [2023-11-19 07:48:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-19 07:48:19,209 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 159 [2023-11-19 07:48:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:19,213 INFO L225 Difference]: With dead ends: 544 [2023-11-19 07:48:19,213 INFO L226 Difference]: Without dead ends: 430 [2023-11-19 07:48:19,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=467, Invalid=1716, Unknown=7, NotChecked=672, Total=2862 [2023-11-19 07:48:19,216 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 661 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 21 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:19,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1525 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2184 Invalid, 12 Unknown, 0 Unchecked, 2.8s Time] [2023-11-19 07:48:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-11-19 07:48:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 201. [2023-11-19 07:48:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 158 states have (on average 1.3101265822784811) internal successors, (207), 158 states have internal predecessors, (207), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:48:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 287 transitions. [2023-11-19 07:48:19,264 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 287 transitions. Word has length 159 [2023-11-19 07:48:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:19,265 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 287 transitions. [2023-11-19 07:48:19,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:48:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 287 transitions. [2023-11-19 07:48:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-19 07:48:19,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:19,268 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:48:19,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 07:48:19,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:19,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:19,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash -433574672, now seen corresponding path program 1 times [2023-11-19 07:48:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460987853] [2023-11-19 07:48:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:19,562 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-19 07:48:19,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379615014] [2023-11-19 07:48:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:19,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:19,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:19,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:48:19,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:48:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:19,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-19 07:48:19,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:48:21,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:48:22,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:22,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-19 07:48:22,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:22,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-19 07:48:22,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 07:48:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 1 proven. 147 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:48:22,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:48:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:22,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460987853] [2023-11-19 07:48:22,461 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-19 07:48:22,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379615014] [2023-11-19 07:48:22,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379615014] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:22,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:48:22,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2023-11-19 07:48:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814101573] [2023-11-19 07:48:22,462 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-19 07:48:22,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 07:48:22,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:22,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 07:48:22,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=164, Unknown=3, NotChecked=0, Total=210 [2023-11-19 07:48:22,465 INFO L87 Difference]: Start difference. First operand 201 states and 287 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:48:23,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:23,240 INFO L93 Difference]: Finished difference Result 334 states and 469 transitions. [2023-11-19 07:48:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:48:23,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 159 [2023-11-19 07:48:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:23,244 INFO L225 Difference]: With dead ends: 334 [2023-11-19 07:48:23,244 INFO L226 Difference]: Without dead ends: 207 [2023-11-19 07:48:23,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=417, Unknown=3, NotChecked=0, Total=552 [2023-11-19 07:48:23,247 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 107 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:23,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 413 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:48:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-11-19 07:48:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2023-11-19 07:48:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 158 states have (on average 1.259493670886076) internal successors, (199), 158 states have internal predecessors, (199), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:48:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 279 transitions. [2023-11-19 07:48:23,318 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 279 transitions. Word has length 159 [2023-11-19 07:48:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:23,319 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 279 transitions. [2023-11-19 07:48:23,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:48:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 279 transitions. [2023-11-19 07:48:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-19 07:48:23,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:23,323 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:48:23,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:48:23,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd45cc-7bc8-4a35-81d4-c543ddc532bd/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 07:48:23,537 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:23,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash 620727986, now seen corresponding path program 1 times [2023-11-19 07:48:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:23,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423526424] [2023-11-19 07:48:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:23,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:26,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:26,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:48:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:48:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:48:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:48:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:48:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:48:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:48:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:48:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:48:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:48:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:48:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:48:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:48:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:48:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:48:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:48:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:48:27,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:27,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423526424] [2023-11-19 07:48:27,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423526424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:27,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:27,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-19 07:48:27,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907648423] [2023-11-19 07:48:27,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:27,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:48:27,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:27,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:48:27,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:48:27,199 INFO L87 Difference]: Start difference. First operand 203 states and 279 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:48:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:29,340 INFO L93 Difference]: Finished difference Result 464 states and 639 transitions. [2023-11-19 07:48:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:48:29,341 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2023-11-19 07:48:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:29,347 INFO L225 Difference]: With dead ends: 464 [2023-11-19 07:48:29,348 INFO L226 Difference]: Without dead ends: 346 [2023-11-19 07:48:29,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2023-11-19 07:48:29,350 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 821 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:29,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 457 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-19 07:48:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-19 07:48:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 230. [2023-11-19 07:48:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 185 states have internal predecessors, (236), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:48:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 316 transitions. [2023-11-19 07:48:29,424 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 316 transitions. Word has length 160 [2023-11-19 07:48:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:29,425 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 316 transitions. [2023-11-19 07:48:29,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:48:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 316 transitions. [2023-11-19 07:48:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-19 07:48:29,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:29,428 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:48:29,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:48:29,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:29,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2061476552, now seen corresponding path program 1 times [2023-11-19 07:48:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:29,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46803496] [2023-11-19 07:48:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat