./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5810cef1f897286bc90da410374f28ca88bc82326212881744282532d103cf3d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:03:58,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:03:58,305 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:03:58,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:03:58,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:03:58,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:03:58,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:03:58,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:03:58,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:03:58,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:03:58,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:03:58,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:03:58,350 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:03:58,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:03:58,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:03:58,352 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:03:58,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:03:58,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:03:58,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:03:58,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:03:58,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:03:58,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:03:58,357 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:03:58,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:03:58,358 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:03:58,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:03:58,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:03:58,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:03:58,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:58,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:03:58,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:03:58,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:03:58,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:03:58,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:03:58,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:03:58,364 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:03:58,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:03:58,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:03:58,365 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:03:58,365 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_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5810cef1f897286bc90da410374f28ca88bc82326212881744282532d103cf3d [2023-11-06 23:03:58,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:03:58,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:03:58,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:03:58,748 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:03:58,749 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:03:58,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-90.i [2023-11-06 23:04:02,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:04:02,477 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:04:02,478 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-90.i [2023-11-06 23:04:02,487 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/data/517905eeb/8bf01d1b0d984b71abd0a31570e4ee3a/FLAG93f21f397 [2023-11-06 23:04:02,504 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/data/517905eeb/8bf01d1b0d984b71abd0a31570e4ee3a [2023-11-06 23:04:02,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:04:02,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:04:02,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:02,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:04:02,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:04:02,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fbf10cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02, skipping insertion in model container [2023-11-06 23:04:02,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,556 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:04:02,753 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_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-90.i[913,926] [2023-11-06 23:04:02,807 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:02,821 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:04:02,835 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_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-90.i[913,926] [2023-11-06 23:04:02,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:02,881 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:04:02,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02 WrapperNode [2023-11-06 23:04:02,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:02,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:02,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:04:02,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:04:02,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,938 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2023-11-06 23:04:02,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:02,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:04:02,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:04:02,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:04:02,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:02,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:04:02,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:04:02,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:04:02,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:04:02,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (1/1) ... [2023-11-06 23:04:03,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:03,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:03,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:04:03,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:04:03,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:04:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 23:04:03,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 23:04:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:04:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:04:03,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:04:03,306 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:04:03,309 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:04:03,640 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:04:03,655 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:04:03,656 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:04:03,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:03 BoogieIcfgContainer [2023-11-06 23:04:03,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:04:03,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:04:03,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:04:03,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:04:03,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:04:02" (1/3) ... [2023-11-06 23:04:03,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b12fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:03, skipping insertion in model container [2023-11-06 23:04:03,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:02" (2/3) ... [2023-11-06 23:04:03,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b12fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:03, skipping insertion in model container [2023-11-06 23:04:03,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:03" (3/3) ... [2023-11-06 23:04:03,669 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-90.i [2023-11-06 23:04:03,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:04:03,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:04:03,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:04:03,772 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69786ee4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:04:03,774 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:04:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 23:04:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 23:04:03,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:03,808 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:03,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:03,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1039288057, now seen corresponding path program 1 times [2023-11-06 23:04:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087857329] [2023-11-06 23:04:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:04:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:04:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:04:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:04:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:04:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:04:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:04:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:04:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:04:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:04:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:04:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:04:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:04:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:04:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:04:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 23:04:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 23:04:04,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:04,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087857329] [2023-11-06 23:04:04,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087857329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:04,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:04,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:04,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149382096] [2023-11-06 23:04:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:04,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:04:04,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:04,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:04:04,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:04:04,500 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 23:04:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:04,541 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2023-11-06 23:04:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:04:04,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2023-11-06 23:04:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:04,556 INFO L225 Difference]: With dead ends: 107 [2023-11-06 23:04:04,556 INFO L226 Difference]: Without dead ends: 53 [2023-11-06 23:04:04,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:04:04,566 INFO L413 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:04,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:04:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-06 23:04:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-06 23:04:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 23:04:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2023-11-06 23:04:04,624 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 124 [2023-11-06 23:04:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:04,625 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2023-11-06 23:04:04,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 23:04:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2023-11-06 23:04:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 23:04:04,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:04,630 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:04,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:04:04,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:04,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1080942329, now seen corresponding path program 1 times [2023-11-06 23:04:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:04,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297109613] [2023-11-06 23:04:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:04:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:04:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:04:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:04:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:04:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:04:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:04:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:04:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:04:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:04:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:04:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:04:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:04:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:04:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:04:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 23:04:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 23:04:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:12,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297109613] [2023-11-06 23:04:12,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297109613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:12,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:12,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:04:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846992405] [2023-11-06 23:04:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:12,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:04:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:12,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:04:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:12,463 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:14,543 INFO L93 Difference]: Finished difference Result 140 states and 205 transitions. [2023-11-06 23:04:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:04:14,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-11-06 23:04:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:14,556 INFO L225 Difference]: With dead ends: 140 [2023-11-06 23:04:14,556 INFO L226 Difference]: Without dead ends: 138 [2023-11-06 23:04:14,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:04:14,559 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 133 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:14,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 576 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 23:04:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-06 23:04:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 86. [2023-11-06 23:04:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 23:04:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2023-11-06 23:04:14,607 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 124 [2023-11-06 23:04:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:14,608 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2023-11-06 23:04:14,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2023-11-06 23:04:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 23:04:14,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:14,612 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:14,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:04:14,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:14,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash -694065033, now seen corresponding path program 1 times [2023-11-06 23:04:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:14,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486352810] [2023-11-06 23:04:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:04:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:04:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:04:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:04:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:04:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:04:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:04:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:04:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:04:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:04:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:04:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:04:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:04:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:04:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:04:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 23:04:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 23:04:20,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:20,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486352810] [2023-11-06 23:04:20,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486352810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:20,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:20,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:04:20,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774126843] [2023-11-06 23:04:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:20,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:04:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:20,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:04:20,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:20,457 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:22,479 INFO L93 Difference]: Finished difference Result 193 states and 277 transitions. [2023-11-06 23:04:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:04:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-11-06 23:04:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:22,485 INFO L225 Difference]: With dead ends: 193 [2023-11-06 23:04:22,485 INFO L226 Difference]: Without dead ends: 191 [2023-11-06 23:04:22,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:04:22,487 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 132 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:22,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 493 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 23:04:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-11-06 23:04:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 82. [2023-11-06 23:04:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 23:04:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2023-11-06 23:04:22,523 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 124 [2023-11-06 23:04:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:22,524 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2023-11-06 23:04:22,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2023-11-06 23:04:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 23:04:22,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:22,527 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:22,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:04:22,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:22,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash -692217991, now seen corresponding path program 1 times [2023-11-06 23:04:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:22,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438929744] [2023-11-06 23:04:22,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:04:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:04:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:04:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:04:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:04:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:04:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:04:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:04:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:04:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:04:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:04:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:04:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:04:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:04:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:04:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 23:04:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 23:04:25,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438929744] [2023-11-06 23:04:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438929744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:25,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:25,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:04:25,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147975805] [2023-11-06 23:04:25,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:25,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:04:25,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:04:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:25,275 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:26,785 INFO L93 Difference]: Finished difference Result 144 states and 209 transitions. [2023-11-06 23:04:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:04:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2023-11-06 23:04:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:26,790 INFO L225 Difference]: With dead ends: 144 [2023-11-06 23:04:26,791 INFO L226 Difference]: Without dead ends: 142 [2023-11-06 23:04:26,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:04:26,794 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 116 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:26,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 564 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:04:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-06 23:04:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 80. [2023-11-06 23:04:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 23:04:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2023-11-06 23:04:26,829 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 124 [2023-11-06 23:04:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:26,831 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2023-11-06 23:04:26,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2023-11-06 23:04:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 23:04:26,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:26,834 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:26,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:04:26,834 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:26,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1163479113, now seen corresponding path program 1 times [2023-11-06 23:04:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:26,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442981738] [2023-11-06 23:04:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:04:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:04:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:04:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:04:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:04:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:04:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:04:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:04:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:04:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:04:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:04:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:04:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:04:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:04:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:04:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 23:04:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 23:04:31,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:31,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442981738] [2023-11-06 23:04:31,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442981738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:31,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:31,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 23:04:31,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947089992] [2023-11-06 23:04:31,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:31,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:04:31,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:04:31,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:04:31,233 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:33,836 INFO L93 Difference]: Finished difference Result 212 states and 297 transitions. [2023-11-06 23:04:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 23:04:33,837 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-06 23:04:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:33,840 INFO L225 Difference]: With dead ends: 212 [2023-11-06 23:04:33,840 INFO L226 Difference]: Without dead ends: 210 [2023-11-06 23:04:33,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2023-11-06 23:04:33,845 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 178 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:33,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 657 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 23:04:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-06 23:04:33,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 70. [2023-11-06 23:04:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 23:04:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2023-11-06 23:04:33,878 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 125 [2023-11-06 23:04:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:33,879 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2023-11-06 23:04:33,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2023-11-06 23:04:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 23:04:33,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:33,882 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:33,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:04:33,883 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:33,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:33,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1165326155, now seen corresponding path program 1 times [2023-11-06 23:04:33,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:33,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15174708] [2023-11-06 23:04:33,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:04:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:04:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:04:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:04:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:04:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:04:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:04:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:04:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:04:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:04:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:04:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:04:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:04:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:04:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:04:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 23:04:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 23:04:36,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:36,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15174708] [2023-11-06 23:04:36,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15174708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:36,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:36,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 23:04:36,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855286898] [2023-11-06 23:04:36,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:36,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:04:36,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:36,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:04:36,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:04:36,469 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:39,974 INFO L93 Difference]: Finished difference Result 217 states and 305 transitions. [2023-11-06 23:04:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 23:04:39,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-06 23:04:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:39,977 INFO L225 Difference]: With dead ends: 217 [2023-11-06 23:04:39,977 INFO L226 Difference]: Without dead ends: 215 [2023-11-06 23:04:39,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2023-11-06 23:04:39,980 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 191 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:39,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 664 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 23:04:39,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-06 23:04:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 67. [2023-11-06 23:04:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 23:04:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2023-11-06 23:04:40,016 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 125 [2023-11-06 23:04:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:40,017 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2023-11-06 23:04:40,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2023-11-06 23:04:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 23:04:40,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:40,019 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:40,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:04:40,020 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:04:40,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash 354132487, now seen corresponding path program 1 times [2023-11-06 23:04:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:40,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664854008] [2023-11-06 23:04:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:04:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:04:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:04:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:04:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:04:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:04:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:04:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:04:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:04:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:04:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:04:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:04:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:04:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:04:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:04:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 23:04:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 23:04:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:43,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664854008] [2023-11-06 23:04:43,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664854008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:43,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:43,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:04:43,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903946284] [2023-11-06 23:04:43,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:43,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:04:43,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:04:43,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:43,566 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:45,185 INFO L93 Difference]: Finished difference Result 146 states and 210 transitions. [2023-11-06 23:04:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:04:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-06 23:04:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:45,187 INFO L225 Difference]: With dead ends: 146 [2023-11-06 23:04:45,187 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:04:45,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:04:45,190 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 142 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:45,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 453 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:04:45,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:04:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:04:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:04:45,191 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2023-11-06 23:04:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:45,192 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:04:45,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 23:04:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:04:45,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:04:45,195 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:04:45,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:04:45,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:04:53,655 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-11-06 23:04:53,656 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-11-06 23:04:53,656 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-11-06 23:04:53,656 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 23:04:53,656 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 23:04:53,656 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (and (= ~var_1_8~0 ~var_1_6~0) (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (let ((.cse0 (* (div ~var_1_6~0 4294967296) 4294967296))) (or (= ~var_1_16~0 ~var_1_15~0) (< (+ ~var_1_7~0 .cse0) (+ (* (div ~var_1_7~0 4294967296) 4294967296) ~var_1_6~0)) (< (+ .cse0 ~var_1_15~0) (+ ~var_1_6~0 (* (div ~var_1_15~0 4294967296) 4294967296) 1))))) [2023-11-06 23:04:53,657 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 114 125) the Hoare annotation is: false [2023-11-06 23:04:53,657 INFO L902 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: true [2023-11-06 23:04:53,657 INFO L902 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: true [2023-11-06 23:04:53,657 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-11-06 23:04:53,657 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-06 23:04:53,657 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:04:53,657 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,657 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,658 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-11-06 23:04:53,658 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 42 72) no Hoare annotation was computed. [2023-11-06 23:04:53,658 INFO L899 garLoopResultBuilder]: For program point L103(lines 73 104) no Hoare annotation was computed. [2023-11-06 23:04:53,658 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,658 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,658 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-06 23:04:53,658 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-06 23:04:53,658 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:04:53,659 INFO L902 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: true [2023-11-06 23:04:53,659 INFO L902 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: true [2023-11-06 23:04:53,659 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2023-11-06 23:04:53,659 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-06 23:04:53,659 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-11-06 23:04:53,659 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 109) no Hoare annotation was computed. [2023-11-06 23:04:53,659 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-11-06 23:04:53,659 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,660 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,660 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2023-11-06 23:04:53,660 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:04:53,661 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-11-06 23:04:53,661 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-11-06 23:04:53,662 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 23:04:53,662 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-06 23:04:53,666 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 110 113) the Hoare annotation is: (and (= ~var_1_8~0 ~var_1_6~0) (let ((.cse19 (+ ~var_1_4~0 ~var_1_3~0)) (.cse15 (* (div ~var_1_5~0 65536) 65536))) (let ((.cse13 (= (+ .cse15 65536 ~var_1_1~0) ~var_1_5~0)) (.cse17 (< .cse19 ~var_1_5~0)) (.cse18 (* 65536 (div .cse19 65536)))) (let ((.cse6 (= (* (div ~var_1_2~0 256) 256) ~var_1_2~0)) (.cse21 (= (+ 65536 .cse18 ~var_1_1~0) .cse19)) (.cse20 (+ .cse18 32768)) (.cse14 (or .cse13 .cse17)) (.cse9 (= (* 256 (div ~var_1_12~0 256)) ~var_1_12~0))) (let ((.cse4 (= (* (div ~var_1_13~0 256) 256) ~var_1_13~0)) (.cse3 (not .cse9)) (.cse8 (= ~var_1_10~0 0)) (.cse0 (or (not .cse21) (and (<= .cse20 .cse19) .cse14))) (.cse10 (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0)) (.cse1 (= ~var_1_10~0 1)) (.cse2 (not (= |ULTIMATE.start_property_#res#1| 0))) (.cse5 (let ((.cse31 (<= ~var_1_15~0 (+ 255 ~var_1_3~0))) (.cse30 (* (div ~var_1_3~0 65536) 65536))) (let ((.cse26 (<= ~var_1_3~0 (+ .cse30 32767))) (.cse27 (and .cse31 (= ~var_1_3~0 (+ .cse30 ~var_1_14~0)))) (.cse25 (and .cse31 (= ~var_1_3~0 (+ .cse30 65536 ~var_1_14~0)))) (.cse23 (<= (+ .cse30 32768) ~var_1_3~0)) (.cse28 (<= (+ 256 ~var_1_3~0) ~var_1_15~0)) (.cse22 (* 65536 (div (+ (- 256) ~var_1_15~0) 65536)))) (or (and (<= (+ .cse22 33024) ~var_1_15~0) (let ((.cse24 (and .cse28 (= (+ 65792 .cse22 ~var_1_14~0) ~var_1_15~0)))) (or (and .cse23 (or .cse24 .cse25)) (and .cse26 (or .cse27 .cse24))))) (and (<= ~var_1_15~0 (+ .cse22 33023)) (let ((.cse29 (and .cse28 (= (+ .cse22 256 ~var_1_14~0) ~var_1_15~0)))) (or (and .cse26 (or .cse29 .cse27)) (and (or .cse29 .cse25) .cse23)))))))) (.cse7 (or (let ((.cse12 (< .cse19 .cse20))) (and (or (and (or .cse12 .cse13) .cse14) (< ~var_1_5~0 (+ .cse15 32768))) (or (< (+ .cse15 32767) ~var_1_5~0) (let ((.cse16 (= (+ .cse15 ~var_1_1~0) ~var_1_5~0))) (and (or .cse16 .cse17) (or .cse12 .cse16)))) (or (= (+ .cse18 ~var_1_1~0) .cse19) (< ~var_1_5~0 (+ ~var_1_4~0 ~var_1_3~0 1))))) .cse21)) (.cse11 (not .cse6))) (or (and .cse0 .cse1 .cse2 (or .cse3 .cse4) .cse5 .cse6 .cse7) (and (not .cse4) .cse8 .cse2 .cse5 .cse6 .cse9) (and .cse10 .cse3 .cse8 .cse2 .cse5 .cse11) (and .cse0 (or .cse9 (not .cse10)) .cse1 .cse2 .cse5 .cse7 .cse11)))))) (let ((.cse32 (* (div ~var_1_6~0 4294967296) 4294967296))) (or (= ~var_1_16~0 ~var_1_15~0) (< (+ ~var_1_7~0 .cse32) (+ (* (div ~var_1_7~0 4294967296) 4294967296) ~var_1_6~0)) (< (+ .cse32 ~var_1_15~0) (+ ~var_1_6~0 (* (div ~var_1_15~0 4294967296) 4294967296) 1))))) [2023-11-06 23:04:53,666 INFO L902 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: true [2023-11-06 23:04:53,666 INFO L902 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: true [2023-11-06 23:04:53,667 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:04:53,667 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-06 23:04:53,667 INFO L899 garLoopResultBuilder]: For program point L58(lines 42 72) no Hoare annotation was computed. [2023-11-06 23:04:53,667 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,667 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,667 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 72) no Hoare annotation was computed. [2023-11-06 23:04:53,667 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-11-06 23:04:53,667 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 61) no Hoare annotation was computed. [2023-11-06 23:04:53,668 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,668 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,668 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (= ~var_1_8~0 ~var_1_6~0) [2023-11-06 23:04:53,668 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-11-06 23:04:53,668 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-06 23:04:53,668 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 23:04:53,668 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 23:04:53,672 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 23:04:53,672 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 23:04:53,675 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:53,678 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:04:53,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:04:53 BoogieIcfgContainer [2023-11-06 23:04:53,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:04:53,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:04:53,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:04:53,758 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:04:53,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:03" (3/4) ... [2023-11-06 23:04:53,761 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:04:53,767 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 23:04:53,776 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 23:04:53,776 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 23:04:53,777 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:04:53,777 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:04:53,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((var_1_8 == var_1_6) && ((((((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (var_1_10 == 1)) && !((\result == 0))) && (!(((256 * (var_1_12 / 256)) == var_1_12)) || (((var_1_13 / 256) * 256) == var_1_13))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) || (((((!((((var_1_13 / 256) * 256) == var_1_13)) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((256 * (var_1_12 / 256)) == var_1_12))) || ((((((((var_1_11 / 256) * 256) == var_1_11) && !(((256 * (var_1_12 / 256)) == var_1_12))) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || (((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (((256 * (var_1_12 / 256)) == var_1_12) || !((((var_1_11 / 256) * 256) == var_1_11)))) && (var_1_10 == 1)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) && !((((var_1_2 / 256) * 256) == var_1_2))))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) [2023-11-06 23:04:53,857 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((var_1_8 == var_1_6) && ((((((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (var_1_10 == 1)) && !((\result == 0))) && (!(((256 * (var_1_12 / 256)) == var_1_12)) || (((var_1_13 / 256) * 256) == var_1_13))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) || (((((!((((var_1_13 / 256) * 256) == var_1_13)) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((256 * (var_1_12 / 256)) == var_1_12))) || ((((((((var_1_11 / 256) * 256) == var_1_11) && !(((256 * (var_1_12 / 256)) == var_1_12))) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || (((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (((256 * (var_1_12 / 256)) == var_1_12) || !((((var_1_11 / 256) * 256) == var_1_11)))) && (var_1_10 == 1)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) && !((((var_1_2 / 256) * 256) == var_1_2))))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) [2023-11-06 23:04:53,875 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:04:53,876 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:04:53,876 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:04:53,877 INFO L158 Benchmark]: Toolchain (without parser) took 51367.77ms. Allocated memory was 121.6MB in the beginning and 465.6MB in the end (delta: 343.9MB). Free memory was 75.7MB in the beginning and 221.4MB in the end (delta: -145.8MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. [2023-11-06 23:04:53,877 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 121.6MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:04:53,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.00ms. Allocated memory is still 121.6MB. Free memory was 75.3MB in the beginning and 63.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:04:53,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.14ms. Allocated memory is still 121.6MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:53,879 INFO L158 Benchmark]: Boogie Preprocessor took 39.17ms. Allocated memory is still 121.6MB. Free memory was 60.7MB in the beginning and 59.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:04:53,880 INFO L158 Benchmark]: RCFGBuilder took 678.34ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 59.3MB in the beginning and 107.4MB in the end (delta: -48.1MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2023-11-06 23:04:53,880 INFO L158 Benchmark]: TraceAbstraction took 50096.23ms. Allocated memory was 153.1MB in the beginning and 465.6MB in the end (delta: 312.5MB). Free memory was 106.6MB in the beginning and 227.7MB in the end (delta: -121.1MB). Peak memory consumption was 267.7MB. Max. memory is 16.1GB. [2023-11-06 23:04:53,881 INFO L158 Benchmark]: Witness Printer took 118.86ms. Allocated memory is still 465.6MB. Free memory was 226.7MB in the beginning and 221.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:04:53,884 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 121.6MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.00ms. Allocated memory is still 121.6MB. Free memory was 75.3MB in the beginning and 63.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.14ms. Allocated memory is still 121.6MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.17ms. Allocated memory is still 121.6MB. Free memory was 60.7MB in the beginning and 59.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 678.34ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 59.3MB in the beginning and 107.4MB in the end (delta: -48.1MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * TraceAbstraction took 50096.23ms. Allocated memory was 153.1MB in the beginning and 465.6MB in the end (delta: 312.5MB). Free memory was 106.6MB in the beginning and 227.7MB in the end (delta: -121.1MB). Peak memory consumption was 267.7MB. Max. memory is 16.1GB. * Witness Printer took 118.86ms. Allocated memory is still 465.6MB. Free memory was 226.7MB in the beginning and 221.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.9s, OverallIterations: 7, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 3486 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2545 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2043 IncrementalHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 941 mSDtfsCounter, 2043 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=2, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 511 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 92 PreInvPairs, 151 NumberOfFragments, 1436 HoareAnnotationTreeSize, 92 FomulaSimplifications, 3002087 FormulaSimplificationTreeSizeReduction, 5.9s HoareSimplificationTime, 25 FomulaSimplificationsInter, 17855 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 871 NumberOfCodeBlocks, 871 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 6160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 5320/5320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((var_1_8 == var_1_6) && ((((((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (var_1_10 == 1)) && !((\result == 0))) && (!(((256 * (var_1_12 / 256)) == var_1_12)) || (((var_1_13 / 256) * 256) == var_1_13))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) || (((((!((((var_1_13 / 256) * 256) == var_1_13)) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && (((var_1_2 / 256) * 256) == var_1_2)) && ((256 * (var_1_12 / 256)) == var_1_12))) || ((((((((var_1_11 / 256) * 256) == var_1_11) && !(((256 * (var_1_12 / 256)) == var_1_12))) && (var_1_10 == 0)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || (((((((!((((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3))) || ((((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768) <= (var_1_4 + var_1_3)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)))) && (((256 * (var_1_12 / 256)) == var_1_12) || !((((var_1_11 / 256) * 256) == var_1_11)))) && (var_1_10 == 1)) && !((\result == 0))) && (((((65536 * ((-256 + var_1_15) / 65536)) + 33024) <= var_1_15) && ((((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3) && ((((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14))))) || ((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && (((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))) || (((256 + var_1_3) <= var_1_15) && (((65792 + (65536 * ((-256 + var_1_15) / 65536))) + var_1_14) == var_1_15)))))) || ((var_1_15 <= ((65536 * ((-256 + var_1_15) / 65536)) + 33023)) && (((var_1_3 <= (((var_1_3 / 65536) * 65536) + 32767)) && ((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == (((var_1_3 / 65536) * 65536) + var_1_14))))) || (((((256 + var_1_3) <= var_1_15) && ((((65536 * ((-256 + var_1_15) / 65536)) + 256) + var_1_14) == var_1_15)) || ((var_1_15 <= (255 + var_1_3)) && (var_1_3 == ((((var_1_3 / 65536) * 65536) + 65536) + var_1_14)))) && ((((var_1_3 / 65536) * 65536) + 32768) <= var_1_3)))))) && ((((((((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || (((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5)) && ((((((var_1_5 / 65536) * 65536) + 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5))) || (var_1_5 < (((var_1_5 / 65536) * 65536) + 32768))) && (((((var_1_5 / 65536) * 65536) + 32767) < var_1_5) || ((((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5) || ((var_1_4 + var_1_3) < var_1_5)) && (((var_1_4 + var_1_3) < ((65536 * ((var_1_4 + var_1_3) / 65536)) + 32768)) || ((((var_1_5 / 65536) * 65536) + var_1_1) == var_1_5))))) && ((((65536 * ((var_1_4 + var_1_3) / 65536)) + var_1_1) == (var_1_4 + var_1_3)) || (var_1_5 < ((var_1_4 + var_1_3) + 1)))) || (((65536 + (65536 * ((var_1_4 + var_1_3) / 65536))) + var_1_1) == (var_1_4 + var_1_3)))) && !((((var_1_2 / 256) * 256) == var_1_2))))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (var_1_8 == var_1_6) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((var_1_8 == var_1_6) && !((cond == 0))) && (((var_1_16 == var_1_15) || ((var_1_7 + ((var_1_6 / 4294967296) * 4294967296)) < (((var_1_7 / 4294967296) * 4294967296) + var_1_6))) || ((((var_1_6 / 4294967296) * 4294967296) + var_1_15) < ((var_1_6 + ((var_1_15 / 4294967296) * 4294967296)) + 1)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 23:04:53,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aab7a00-3eb4-4dcd-8d48-2842695e3a05/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE