./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl --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 fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:30:06,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:30:06,610 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:30:06,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:30:06,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:30:06,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:30:06,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:30:06,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:30:06,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:30:06,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:30:06,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:30:06,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:30:06,648 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:30:06,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:30:06,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:30:06,650 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:30:06,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:30:06,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:30:06,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:30:06,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:30:06,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:30:06,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:30:06,654 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:30:06,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:30:06,655 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:30:06,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:30:06,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:30:06,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:30:06,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:30:06,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:30:06,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:30:06,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:30:06,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:30:06,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:30:06,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:30:06,660 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:30:06,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:30:06,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:30:06,661 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:30:06,662 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_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/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_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl 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 -> fa1f0900915e9d0a4bf98ef205532704c7807bfe3d7587fb7faefc96b22ae06b [2023-11-12 02:30:06,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:30:06,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:30:06,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:30:06,993 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:30:06,993 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:30:06,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2023-11-12 02:30:10,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:30:10,403 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:30:10,405 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i [2023-11-12 02:30:10,420 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/data/21c32d6a9/e453da3f6fd244de961a999d318e3f8f/FLAG5baa26985 [2023-11-12 02:30:10,439 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/data/21c32d6a9/e453da3f6fd244de961a999d318e3f8f [2023-11-12 02:30:10,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:30:10,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:30:10,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:30:10,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:30:10,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:30:10,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19414658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10, skipping insertion in model container [2023-11-12 02:30:10,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,490 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:30:10,623 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_8dacdace-bb24-4556-bd31-a5f159293295/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2023-11-12 02:30:10,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:30:10,730 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:30:10,741 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_8dacdace-bb24-4556-bd31-a5f159293295/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-14.i[916,929] [2023-11-12 02:30:10,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:30:10,812 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:30:10,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10 WrapperNode [2023-11-12 02:30:10,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:30:10,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:30:10,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:30:10,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:30:10,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,910 INFO L138 Inliner]: procedures = 29, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 511 [2023-11-12 02:30:10,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:30:10,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:30:10,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:30:10,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:30:10,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:11,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:30:11,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:30:11,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:30:11,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:30:11,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:11,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:30:11,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:30:11,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:30:11,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:30:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:30:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-12 02:30:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:30:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-12 02:30:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:30:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-12 02:30:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:30:11,103 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:30:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:30:11,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:30:11,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:30:11,298 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:30:11,301 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:30:11,975 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:30:11,984 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:30:11,984 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:30:11,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:30:11 BoogieIcfgContainer [2023-11-12 02:30:11,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:30:11,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:30:11,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:30:11,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:30:11,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:30:10" (1/3) ... [2023-11-12 02:30:11,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aaff048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:30:11, skipping insertion in model container [2023-11-12 02:30:11,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10" (2/3) ... [2023-11-12 02:30:11,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aaff048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:30:11, skipping insertion in model container [2023-11-12 02:30:11,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:30:11" (3/3) ... [2023-11-12 02:30:11,997 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-14.i [2023-11-12 02:30:12,047 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:30:12,049 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:30:12,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:30:12,171 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;@51a740fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:30:12,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:30:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:30:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-12 02:30:12,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:12,205 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:12,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:12,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash -889072514, now seen corresponding path program 1 times [2023-11-12 02:30:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:12,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174592543] [2023-11-12 02:30:12,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:12,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:12,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174592543] [2023-11-12 02:30:12,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174592543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:12,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:12,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:30:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125998511] [2023-11-12 02:30:12,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:12,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:30:12,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:12,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:30:12,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:30:12,881 INFO L87 Difference]: Start difference. First operand has 128 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-12 02:30:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:12,958 INFO L93 Difference]: Finished difference Result 249 states and 395 transitions. [2023-11-12 02:30:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:30:12,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2023-11-12 02:30:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:12,975 INFO L225 Difference]: With dead ends: 249 [2023-11-12 02:30:12,975 INFO L226 Difference]: Without dead ends: 124 [2023-11-12 02:30:12,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-12 02:30:12,985 INFO L413 NwaCegarLoop]: 183 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, 183 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-12 02:30:12,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-12 02:30:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-12 02:30:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:30:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2023-11-12 02:30:13,070 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 168 [2023-11-12 02:30:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:13,071 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2023-11-12 02:30:13,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-12 02:30:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2023-11-12 02:30:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-12 02:30:13,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:13,083 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:13,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:30:13,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:13,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash -750993444, now seen corresponding path program 1 times [2023-11-12 02:30:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:13,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073242310] [2023-11-12 02:30:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:13,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073242310] [2023-11-12 02:30:13,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073242310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:13,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:13,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:30:13,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483665466] [2023-11-12 02:30:13,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:13,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:30:13,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:13,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:30:13,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:30:13,739 INFO L87 Difference]: Start difference. First operand 124 states and 183 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-12 02:30:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:13,797 INFO L93 Difference]: Finished difference Result 251 states and 372 transitions. [2023-11-12 02:30:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:30:13,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2023-11-12 02:30:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:13,801 INFO L225 Difference]: With dead ends: 251 [2023-11-12 02:30:13,801 INFO L226 Difference]: Without dead ends: 130 [2023-11-12 02:30:13,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-12 02:30:13,804 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 10 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:13,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 537 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-12 02:30:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2023-11-12 02:30:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:30:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2023-11-12 02:30:13,821 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 168 [2023-11-12 02:30:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:13,822 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2023-11-12 02:30:13,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-12 02:30:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2023-11-12 02:30:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-12 02:30:13,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:13,826 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:13,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:30:13,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:13,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:13,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1942902746, now seen corresponding path program 1 times [2023-11-12 02:30:13,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:13,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896946498] [2023-11-12 02:30:13,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:13,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:13,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:14,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896946498] [2023-11-12 02:30:14,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896946498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:14,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:14,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:30:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353524689] [2023-11-12 02:30:14,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:14,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:30:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:30:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:14,059 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:14,084 INFO L93 Difference]: Finished difference Result 275 states and 407 transitions. [2023-11-12 02:30:14,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:30:14,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2023-11-12 02:30:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:14,088 INFO L225 Difference]: With dead ends: 275 [2023-11-12 02:30:14,088 INFO L226 Difference]: Without dead ends: 152 [2023-11-12 02:30:14,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:30:14,091 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 38 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:14,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-12 02:30:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2023-11-12 02:30:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:30:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 186 transitions. [2023-11-12 02:30:14,111 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 186 transitions. Word has length 168 [2023-11-12 02:30:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:14,112 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 186 transitions. [2023-11-12 02:30:14,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 186 transitions. [2023-11-12 02:30:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-12 02:30:14,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:14,115 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:14,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:30:14,115 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:14,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:14,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1650999972, now seen corresponding path program 1 times [2023-11-12 02:30:14,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:14,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220895894] [2023-11-12 02:30:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:14,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:14,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:14,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220895894] [2023-11-12 02:30:14,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220895894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:14,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:30:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169108330] [2023-11-12 02:30:14,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:14,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:30:14,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:14,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:30:14,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:30:14,554 INFO L87 Difference]: Start difference. First operand 127 states and 186 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:14,602 INFO L93 Difference]: Finished difference Result 276 states and 407 transitions. [2023-11-12 02:30:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:30:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2023-11-12 02:30:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:14,606 INFO L225 Difference]: With dead ends: 276 [2023-11-12 02:30:14,606 INFO L226 Difference]: Without dead ends: 152 [2023-11-12 02:30:14,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-12 02:30:14,608 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 41 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:14,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 593 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-12 02:30:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2023-11-12 02:30:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:30:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 188 transitions. [2023-11-12 02:30:14,621 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 188 transitions. Word has length 168 [2023-11-12 02:30:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:14,623 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 188 transitions. [2023-11-12 02:30:14,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 188 transitions. [2023-11-12 02:30:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-12 02:30:14,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:14,626 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:14,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:30:14,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:14,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1684737308, now seen corresponding path program 1 times [2023-11-12 02:30:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:14,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047768100] [2023-11-12 02:30:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:15,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:15,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047768100] [2023-11-12 02:30:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047768100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:15,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:15,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:30:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395974400] [2023-11-12 02:30:15,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:15,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:30:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:30:15,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:30:15,463 INFO L87 Difference]: Start difference. First operand 129 states and 188 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:15,955 INFO L93 Difference]: Finished difference Result 316 states and 461 transitions. [2023-11-12 02:30:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:30:15,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2023-11-12 02:30:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:15,958 INFO L225 Difference]: With dead ends: 316 [2023-11-12 02:30:15,959 INFO L226 Difference]: Without dead ends: 190 [2023-11-12 02:30:15,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:30:15,966 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 254 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:15,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 571 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:30:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-12 02:30:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 132. [2023-11-12 02:30:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.385321100917431) internal successors, (151), 109 states have internal predecessors, (151), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:30:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2023-11-12 02:30:15,992 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 168 [2023-11-12 02:30:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:15,994 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2023-11-12 02:30:15,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2023-11-12 02:30:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-12 02:30:15,997 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:15,997 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:15,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:30:15,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:15,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash 673620058, now seen corresponding path program 1 times [2023-11-12 02:30:15,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:15,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103323210] [2023-11-12 02:30:15,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:15,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:16,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:16,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103323210] [2023-11-12 02:30:16,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103323210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:16,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:16,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:30:16,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682669377] [2023-11-12 02:30:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:16,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:30:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:16,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:30:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:30:16,949 INFO L87 Difference]: Start difference. First operand 132 states and 193 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:17,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:17,288 INFO L93 Difference]: Finished difference Result 315 states and 457 transitions. [2023-11-12 02:30:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:30:17,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2023-11-12 02:30:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:17,292 INFO L225 Difference]: With dead ends: 315 [2023-11-12 02:30:17,292 INFO L226 Difference]: Without dead ends: 186 [2023-11-12 02:30:17,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:30:17,296 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 79 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:17,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 533 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:30:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-12 02:30:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2023-11-12 02:30:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 152 states have internal predecessors, (206), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-12 02:30:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 264 transitions. [2023-11-12 02:30:17,320 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 264 transitions. Word has length 168 [2023-11-12 02:30:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:17,321 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 264 transitions. [2023-11-12 02:30:17,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 264 transitions. [2023-11-12 02:30:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-12 02:30:17,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:17,327 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:17,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:30:17,328 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:17,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash -606243620, now seen corresponding path program 1 times [2023-11-12 02:30:17,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:17,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858584586] [2023-11-12 02:30:17,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:17,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:18,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858584586] [2023-11-12 02:30:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858584586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:30:18,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76283098] [2023-11-12 02:30:18,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:18,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:30:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:18,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:30:18,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:30:18,428 INFO L87 Difference]: Start difference. First operand 183 states and 264 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:18,748 INFO L93 Difference]: Finished difference Result 388 states and 559 transitions. [2023-11-12 02:30:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:30:18,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2023-11-12 02:30:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:18,752 INFO L225 Difference]: With dead ends: 388 [2023-11-12 02:30:18,752 INFO L226 Difference]: Without dead ends: 208 [2023-11-12 02:30:18,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:30:18,754 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 165 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:18,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 582 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:30:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-12 02:30:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2023-11-12 02:30:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 148 states have (on average 1.3513513513513513) internal successors, (200), 149 states have internal predecessors, (200), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-12 02:30:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 258 transitions. [2023-11-12 02:30:18,769 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 258 transitions. Word has length 168 [2023-11-12 02:30:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:18,769 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 258 transitions. [2023-11-12 02:30:18,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 258 transitions. [2023-11-12 02:30:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-12 02:30:18,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:18,773 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:18,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:30:18,773 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:18,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1010997333, now seen corresponding path program 1 times [2023-11-12 02:30:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:18,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096183920] [2023-11-12 02:30:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:19,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:19,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096183920] [2023-11-12 02:30:19,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096183920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:19,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:19,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:30:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214818863] [2023-11-12 02:30:19,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:19,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:30:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:30:19,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:30:19,815 INFO L87 Difference]: Start difference. First operand 180 states and 258 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:20,306 INFO L93 Difference]: Finished difference Result 363 states and 517 transitions. [2023-11-12 02:30:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:30:20,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2023-11-12 02:30:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:20,309 INFO L225 Difference]: With dead ends: 363 [2023-11-12 02:30:20,309 INFO L226 Difference]: Without dead ends: 186 [2023-11-12 02:30:20,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:30:20,312 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 385 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:20,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 508 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:30:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-12 02:30:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 134. [2023-11-12 02:30:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 110 states have internal predecessors, (147), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:30:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 189 transitions. [2023-11-12 02:30:20,328 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 189 transitions. Word has length 170 [2023-11-12 02:30:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:20,329 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 189 transitions. [2023-11-12 02:30:20,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 189 transitions. [2023-11-12 02:30:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-12 02:30:20,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:20,332 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:20,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:30:20,333 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:20,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1686046699, now seen corresponding path program 1 times [2023-11-12 02:30:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:20,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598571371] [2023-11-12 02:30:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-12 02:30:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598571371] [2023-11-12 02:30:22,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598571371] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:30:22,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897665764] [2023-11-12 02:30:22,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:22,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:30:22,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:30:22,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:30:23,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:30:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:23,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-12 02:30:23,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:30:23,510 INFO L351 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 7 treesize of output 3 [2023-11-12 02:30:24,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:30:24,407 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:30:24,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:30:25,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:25,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:25,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:25,300 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:25,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:25,502 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:25,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:25,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:26,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:26,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:26,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:26,227 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:26,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:26,440 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:26,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:26,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:26,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:26,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:26,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:26,955 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:27,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-12 02:30:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 7 proven. 581 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-11-12 02:30:27,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:30:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897665764] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:30:27,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:30:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2023-11-12 02:30:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404273025] [2023-11-12 02:30:27,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:30:27,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-12 02:30:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 02:30:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=537, Unknown=1, NotChecked=0, Total=650 [2023-11-12 02:30:27,363 INFO L87 Difference]: Start difference. First operand 134 states and 189 transitions. Second operand has 23 states, 21 states have (on average 6.333333333333333) internal successors, (133), 23 states have internal predecessors, (133), 7 states have call successors, (42), 5 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2023-11-12 02:30:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:31,284 INFO L93 Difference]: Finished difference Result 642 states and 897 transitions. [2023-11-12 02:30:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-12 02:30:31,285 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.333333333333333) internal successors, (133), 23 states have internal predecessors, (133), 7 states have call successors, (42), 5 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) Word has length 170 [2023-11-12 02:30:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:31,289 INFO L225 Difference]: With dead ends: 642 [2023-11-12 02:30:31,289 INFO L226 Difference]: Without dead ends: 511 [2023-11-12 02:30:31,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=573, Invalid=2396, Unknown=1, NotChecked=0, Total=2970 [2023-11-12 02:30:31,298 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1489 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:31,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1175 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-12 02:30:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-11-12 02:30:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 282. [2023-11-12 02:30:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 233 states have internal predecessors, (303), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-12 02:30:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 387 transitions. [2023-11-12 02:30:31,358 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 387 transitions. Word has length 170 [2023-11-12 02:30:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:31,358 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 387 transitions. [2023-11-12 02:30:31,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.333333333333333) internal successors, (133), 23 states have internal predecessors, (133), 7 states have call successors, (42), 5 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2023-11-12 02:30:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 387 transitions. [2023-11-12 02:30:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-12 02:30:31,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:31,362 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:31,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:30:31,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-12 02:30:31,570 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:31,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1598418923, now seen corresponding path program 1 times [2023-11-12 02:30:31,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:31,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611428084] [2023-11-12 02:30:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:34,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:34,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611428084] [2023-11-12 02:30:34,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611428084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:34,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:34,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:30:34,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266088537] [2023-11-12 02:30:34,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:34,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:30:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:34,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:30:34,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:30:34,570 INFO L87 Difference]: Start difference. First operand 282 states and 387 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:36,089 INFO L93 Difference]: Finished difference Result 814 states and 1109 transitions. [2023-11-12 02:30:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 02:30:36,090 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2023-11-12 02:30:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:36,094 INFO L225 Difference]: With dead ends: 814 [2023-11-12 02:30:36,094 INFO L226 Difference]: Without dead ends: 535 [2023-11-12 02:30:36,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-11-12 02:30:36,096 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 632 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:36,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 825 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-12 02:30:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2023-11-12 02:30:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 337. [2023-11-12 02:30:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 288 states have (on average 1.2951388888888888) internal successors, (373), 288 states have internal predecessors, (373), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-12 02:30:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 457 transitions. [2023-11-12 02:30:36,158 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 457 transitions. Word has length 170 [2023-11-12 02:30:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:36,159 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 457 transitions. [2023-11-12 02:30:36,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 457 transitions. [2023-11-12 02:30:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-12 02:30:36,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:36,163 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:36,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:30:36,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:36,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1379564205, now seen corresponding path program 1 times [2023-11-12 02:30:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:36,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829619763] [2023-11-12 02:30:36,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:36,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:36,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829619763] [2023-11-12 02:30:36,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829619763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:36,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:30:36,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429827539] [2023-11-12 02:30:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:36,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:30:36,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:36,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:30:36,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:30:36,365 INFO L87 Difference]: Start difference. First operand 337 states and 457 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:36,449 INFO L93 Difference]: Finished difference Result 665 states and 909 transitions. [2023-11-12 02:30:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:30:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 170 [2023-11-12 02:30:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:36,455 INFO L225 Difference]: With dead ends: 665 [2023-11-12 02:30:36,455 INFO L226 Difference]: Without dead ends: 331 [2023-11-12 02:30:36,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-12 02:30:36,457 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 2 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:36,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 531 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:30:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-12 02:30:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 330. [2023-11-12 02:30:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 281 states have (on average 1.291814946619217) internal successors, (363), 281 states have internal predecessors, (363), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-12 02:30:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 447 transitions. [2023-11-12 02:30:36,524 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 447 transitions. Word has length 170 [2023-11-12 02:30:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:36,525 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 447 transitions. [2023-11-12 02:30:36,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 447 transitions. [2023-11-12 02:30:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-12 02:30:36,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:36,529 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:36,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:30:36,529 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:36,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1012974875, now seen corresponding path program 1 times [2023-11-12 02:30:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759581160] [2023-11-12 02:30:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:37,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759581160] [2023-11-12 02:30:37,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759581160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:37,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:37,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:30:37,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033862109] [2023-11-12 02:30:37,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:37,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:30:37,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:37,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:30:37,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:30:37,118 INFO L87 Difference]: Start difference. First operand 330 states and 447 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:37,394 INFO L93 Difference]: Finished difference Result 629 states and 839 transitions. [2023-11-12 02:30:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:30:37,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-11-12 02:30:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:37,399 INFO L225 Difference]: With dead ends: 629 [2023-11-12 02:30:37,400 INFO L226 Difference]: Without dead ends: 452 [2023-11-12 02:30:37,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:30:37,401 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 74 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:37,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 695 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:30:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-11-12 02:30:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 338. [2023-11-12 02:30:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 289 states have (on average 1.2837370242214532) internal successors, (371), 289 states have internal predecessors, (371), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-12 02:30:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 455 transitions. [2023-11-12 02:30:37,456 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 455 transitions. Word has length 172 [2023-11-12 02:30:37,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:37,456 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 455 transitions. [2023-11-12 02:30:37,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 455 transitions. [2023-11-12 02:30:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-12 02:30:37,461 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:37,461 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:37,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:30:37,462 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:37,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash 195326425, now seen corresponding path program 1 times [2023-11-12 02:30:37,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:37,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514590557] [2023-11-12 02:30:37,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:37,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-12 02:30:39,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514590557] [2023-11-12 02:30:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514590557] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:30:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769124457] [2023-11-12 02:30:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:39,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:30:39,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:30:39,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:30:39,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:30:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:39,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-12 02:30:39,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:30:40,036 INFO L351 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 7 treesize of output 3 [2023-11-12 02:30:40,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:30:40,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:30:41,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:30:41,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:41,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:41,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:41,714 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:41,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:41,908 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:42,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:42,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:42,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:42,382 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:42,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:42,567 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:42,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:42,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:42,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:42,945 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:43,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:43,160 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:43,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:30:43,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-12 02:30:43,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-12 02:30:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 7 proven. 581 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-11-12 02:30:43,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:30:43,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769124457] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:30:43,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:30:43,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2023-11-12 02:30:43,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400663254] [2023-11-12 02:30:43,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:30:43,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-12 02:30:43,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:43,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-12 02:30:43,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=635, Unknown=2, NotChecked=0, Total=756 [2023-11-12 02:30:43,699 INFO L87 Difference]: Start difference. First operand 338 states and 455 transitions. Second operand has 25 states, 23 states have (on average 5.956521739130435) internal successors, (137), 25 states have internal predecessors, (137), 7 states have call successors, (42), 5 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2023-11-12 02:30:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:45,209 INFO L93 Difference]: Finished difference Result 500 states and 673 transitions. [2023-11-12 02:30:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:30:45,210 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 5.956521739130435) internal successors, (137), 25 states have internal predecessors, (137), 7 states have call successors, (42), 5 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) Word has length 172 [2023-11-12 02:30:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:45,214 INFO L225 Difference]: With dead ends: 500 [2023-11-12 02:30:45,214 INFO L226 Difference]: Without dead ends: 321 [2023-11-12 02:30:45,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=1156, Unknown=2, NotChecked=0, Total=1482 [2023-11-12 02:30:45,220 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 757 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:45,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 583 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-12 02:30:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-12 02:30:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 152. [2023-11-12 02:30:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 127 states have internal predecessors, (161), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:30:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 203 transitions. [2023-11-12 02:30:45,254 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 203 transitions. Word has length 172 [2023-11-12 02:30:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:45,255 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 203 transitions. [2023-11-12 02:30:45,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 5.956521739130435) internal successors, (137), 25 states have internal predecessors, (137), 7 states have call successors, (42), 5 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 7 states have call successors, (42) [2023-11-12 02:30:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 203 transitions. [2023-11-12 02:30:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-12 02:30:45,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:45,259 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:45,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:30:45,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dacdace-bb24-4556-bd31-a5f159293295/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-12 02:30:45,467 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:45,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:45,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1185443863, now seen corresponding path program 1 times [2023-11-12 02:30:45,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:45,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058107213] [2023-11-12 02:30:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:47,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:47,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058107213] [2023-11-12 02:30:47,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058107213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:47,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:47,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:30:47,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253032266] [2023-11-12 02:30:47,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:47,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:30:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:47,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:30:47,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:30:47,972 INFO L87 Difference]: Start difference. First operand 152 states and 203 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:48,721 INFO L93 Difference]: Finished difference Result 327 states and 435 transitions. [2023-11-12 02:30:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:30:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 172 [2023-11-12 02:30:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:48,724 INFO L225 Difference]: With dead ends: 327 [2023-11-12 02:30:48,724 INFO L226 Difference]: Without dead ends: 178 [2023-11-12 02:30:48,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:30:48,725 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 205 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:48,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 593 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:30:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-12 02:30:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 137. [2023-11-12 02:30:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 112 states have internal predecessors, (144), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:30:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2023-11-12 02:30:48,762 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 172 [2023-11-12 02:30:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:48,762 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2023-11-12 02:30:48,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2023-11-12 02:30:48,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-12 02:30:48,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:48,766 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:48,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:30:48,766 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:48,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash -396463512, now seen corresponding path program 1 times [2023-11-12 02:30:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229019009] [2023-11-12 02:30:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:30:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:30:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:30:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:30:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:30:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:30:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:30:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:30:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:30:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:30:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:30:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:30:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:30:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229019009] [2023-11-12 02:30:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229019009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:49,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:30:49,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334587869] [2023-11-12 02:30:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:49,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:30:49,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:49,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:30:49,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:30:49,979 INFO L87 Difference]: Start difference. First operand 137 states and 186 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:50,369 INFO L93 Difference]: Finished difference Result 322 states and 436 transitions. [2023-11-12 02:30:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:30:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 175 [2023-11-12 02:30:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:50,371 INFO L225 Difference]: With dead ends: 322 [2023-11-12 02:30:50,371 INFO L226 Difference]: Without dead ends: 188 [2023-11-12 02:30:50,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:30:50,377 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 198 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:50,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 815 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:30:50,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-12 02:30:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 156. [2023-11-12 02:30:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 131 states have internal predecessors, (166), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:30:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 208 transitions. [2023-11-12 02:30:50,427 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 208 transitions. Word has length 175 [2023-11-12 02:30:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:50,429 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 208 transitions. [2023-11-12 02:30:50,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:30:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 208 transitions. [2023-11-12 02:30:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-12 02:30:50,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:50,432 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:30:50,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:30:50,432 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:50,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash -812166490, now seen corresponding path program 1 times [2023-11-12 02:30:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917201756] [2023-11-12 02:30:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms