./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9919edf89ff355ff3a89dd02d1d8130750e0281602370d18eeec2f6bdc3d61ca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:31:26,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:31:27,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:31:27,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:31:27,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:31:27,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:31:27,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:31:27,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:31:27,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:31:27,051 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:31:27,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:31:27,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:31:27,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:31:27,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:31:27,052 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:31:27,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:31:27,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:31:27,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:31:27,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:31:27,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:31:27,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:31:27,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:31:27,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:31:27,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:31:27,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:31:27,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:31:27,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:31:27,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:31:27,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:31:27,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:31:27,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:31:27,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:31:27,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:31:27,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:31:27,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:31:27,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:31:27,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:31:27,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:31:27,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:31:27,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:31:27,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:31:27,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:31:27,062 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9919edf89ff355ff3a89dd02d1d8130750e0281602370d18eeec2f6bdc3d61ca [2024-10-13 02:31:27,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:31:27,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:31:27,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:31:27,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:31:27,326 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:31:27,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i [2024-10-13 02:31:28,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:31:28,632 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-13 02:31:28,795 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:31:28,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i [2024-10-13 02:31:28,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ee46215/a955f19c4d6b45bd8ec4f9572eeec3cc/FLAG299a82261 [2024-10-13 02:31:28,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ee46215/a955f19c4d6b45bd8ec4f9572eeec3cc [2024-10-13 02:31:28,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:31:28,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:31:28,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:31:28,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:31:28,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:31:28,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:31:28" (1/1) ... [2024-10-13 02:31:28,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774e8c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:28, skipping insertion in model container [2024-10-13 02:31:28,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:31:28" (1/1) ... [2024-10-13 02:31:28,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:31:29,009 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i[918,931] [2024-10-13 02:31:29,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:31:29,098 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:31:29,109 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i[918,931] [2024-10-13 02:31:29,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:31:29,161 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:31:29,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29 WrapperNode [2024-10-13 02:31:29,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:31:29,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:31:29,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:31:29,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:31:29,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,240 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2024-10-13 02:31:29,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:31:29,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:31:29,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:31:29,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:31:29,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,268 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:31:29,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:31:29,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:31:29,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:31:29,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:31:29,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (1/1) ... [2024-10-13 02:31:29,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:31:29,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:31:29,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:31:29,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:31:29,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:31:29,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:31:29,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:31:29,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:31:29,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:31:29,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:31:29,504 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:31:29,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:31:29,845 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 02:31:29,845 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:31:29,892 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:31:29,893 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:31:29,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:31:29 BoogieIcfgContainer [2024-10-13 02:31:29,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:31:29,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:31:29,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:31:29,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:31:29,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:31:28" (1/3) ... [2024-10-13 02:31:29,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171cec5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:31:29, skipping insertion in model container [2024-10-13 02:31:29,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:29" (2/3) ... [2024-10-13 02:31:29,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171cec5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:31:29, skipping insertion in model container [2024-10-13 02:31:29,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:31:29" (3/3) ... [2024-10-13 02:31:29,903 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i [2024-10-13 02:31:29,916 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:31:29,917 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:31:29,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:31:29,970 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d920398, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:31:29,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:31:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 02:31:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-13 02:31:29,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:29,993 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:29,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:29,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1494991005, now seen corresponding path program 1 times [2024-10-13 02:31:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797453265] [2024-10-13 02:31:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:31:30,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797453265] [2024-10-13 02:31:30,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797453265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:30,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:30,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:31:30,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557178535] [2024-10-13 02:31:30,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:31:30,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:30,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:31:30,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:31:30,519 INFO L87 Difference]: Start difference. First operand has 97 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 02:31:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:30,572 INFO L93 Difference]: Finished difference Result 191 states and 348 transitions. [2024-10-13 02:31:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:31:30,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2024-10-13 02:31:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:30,586 INFO L225 Difference]: With dead ends: 191 [2024-10-13 02:31:30,587 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 02:31:30,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:31:30,596 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:30,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:31:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 02:31:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 02:31:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 02:31:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 152 transitions. [2024-10-13 02:31:30,652 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 152 transitions. Word has length 212 [2024-10-13 02:31:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:30,652 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 152 transitions. [2024-10-13 02:31:30,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 02:31:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 152 transitions. [2024-10-13 02:31:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-13 02:31:30,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:30,658 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:30,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:31:30,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1808841157, now seen corresponding path program 1 times [2024-10-13 02:31:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:30,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922073474] [2024-10-13 02:31:30,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:31:31,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:31,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922073474] [2024-10-13 02:31:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922073474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:31,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:31,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:31:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794903119] [2024-10-13 02:31:31,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:31,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:31:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:31,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:31:31,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:31:31,148 INFO L87 Difference]: Start difference. First operand 95 states and 152 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:31,244 INFO L93 Difference]: Finished difference Result 280 states and 449 transitions. [2024-10-13 02:31:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:31:31,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213 [2024-10-13 02:31:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:31,250 INFO L225 Difference]: With dead ends: 280 [2024-10-13 02:31:31,251 INFO L226 Difference]: Without dead ends: 186 [2024-10-13 02:31:31,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:31:31,255 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 135 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:31,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 373 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:31:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-13 02:31:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2024-10-13 02:31:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 113 states have (on average 1.3982300884955752) internal successors, (158), 113 states have internal predecessors, (158), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 02:31:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 294 transitions. [2024-10-13 02:31:31,287 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 294 transitions. Word has length 213 [2024-10-13 02:31:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:31,288 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 294 transitions. [2024-10-13 02:31:31,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 294 transitions. [2024-10-13 02:31:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 02:31:31,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:31,292 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:31,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:31:31,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:31,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2069886210, now seen corresponding path program 1 times [2024-10-13 02:31:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:31,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241669973] [2024-10-13 02:31:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:31:31,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:31,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241669973] [2024-10-13 02:31:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241669973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:31,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:31,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:31:31,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91477012] [2024-10-13 02:31:31,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:31,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:31:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:31,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:31:31,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:31:31,741 INFO L87 Difference]: Start difference. First operand 184 states and 294 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:31,795 INFO L93 Difference]: Finished difference Result 278 states and 445 transitions. [2024-10-13 02:31:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:31:31,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2024-10-13 02:31:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:31,797 INFO L225 Difference]: With dead ends: 278 [2024-10-13 02:31:31,798 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 02:31:31,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:31:31,801 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:31,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 135 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:31:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 02:31:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 02:31:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 02:31:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 151 transitions. [2024-10-13 02:31:31,815 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 151 transitions. Word has length 214 [2024-10-13 02:31:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:31,815 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 151 transitions. [2024-10-13 02:31:31,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 151 transitions. [2024-10-13 02:31:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 02:31:31,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:31,823 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:31,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:31:31,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:31,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash 312449234, now seen corresponding path program 1 times [2024-10-13 02:31:31,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:31,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619476823] [2024-10-13 02:31:31,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:31:32,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:32,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619476823] [2024-10-13 02:31:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619476823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:32,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:32,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:31:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877161463] [2024-10-13 02:31:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:32,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:31:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:32,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:31:32,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:31:32,578 INFO L87 Difference]: Start difference. First operand 95 states and 151 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:32,917 INFO L93 Difference]: Finished difference Result 313 states and 494 transitions. [2024-10-13 02:31:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:31:32,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2024-10-13 02:31:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:32,919 INFO L225 Difference]: With dead ends: 313 [2024-10-13 02:31:32,920 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 02:31:32,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:31:32,921 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 194 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:32,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 777 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:31:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 02:31:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 191. [2024-10-13 02:31:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 02:31:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 303 transitions. [2024-10-13 02:31:32,943 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 303 transitions. Word has length 214 [2024-10-13 02:31:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:32,944 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 303 transitions. [2024-10-13 02:31:32,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 303 transitions. [2024-10-13 02:31:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 02:31:32,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:32,945 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:32,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:31:32,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:32,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:32,946 INFO L85 PathProgramCache]: Analyzing trace with hash 369707536, now seen corresponding path program 1 times [2024-10-13 02:31:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:32,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053625262] [2024-10-13 02:31:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:31:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053625262] [2024-10-13 02:31:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053625262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:36,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:36,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 02:31:36,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005009426] [2024-10-13 02:31:36,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:36,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:31:36,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:36,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:31:36,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:31:36,944 INFO L87 Difference]: Start difference. First operand 191 states and 303 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:37,511 INFO L93 Difference]: Finished difference Result 545 states and 849 transitions. [2024-10-13 02:31:37,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:31:37,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2024-10-13 02:31:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:37,515 INFO L225 Difference]: With dead ends: 545 [2024-10-13 02:31:37,515 INFO L226 Difference]: Without dead ends: 355 [2024-10-13 02:31:37,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:31:37,517 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 132 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:37,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 633 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:31:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-13 02:31:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 290. [2024-10-13 02:31:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 213 states have (on average 1.431924882629108) internal successors, (305), 215 states have internal predecessors, (305), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 02:31:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 449 transitions. [2024-10-13 02:31:37,548 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 449 transitions. Word has length 214 [2024-10-13 02:31:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:37,548 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 449 transitions. [2024-10-13 02:31:37,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 449 transitions. [2024-10-13 02:31:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 02:31:37,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:37,550 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:37,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:31:37,551 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:37,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1218640366, now seen corresponding path program 1 times [2024-10-13 02:31:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573796483] [2024-10-13 02:31:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:31:37,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:37,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573796483] [2024-10-13 02:31:37,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573796483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:37,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:37,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:31:37,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227758284] [2024-10-13 02:31:37,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:37,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:31:37,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:31:37,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:31:37,964 INFO L87 Difference]: Start difference. First operand 290 states and 449 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:38,049 INFO L93 Difference]: Finished difference Result 839 states and 1302 transitions. [2024-10-13 02:31:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:31:38,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2024-10-13 02:31:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:38,059 INFO L225 Difference]: With dead ends: 839 [2024-10-13 02:31:38,059 INFO L226 Difference]: Without dead ends: 550 [2024-10-13 02:31:38,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:31:38,061 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 82 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:38,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 290 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:31:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-13 02:31:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2024-10-13 02:31:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 395 states have (on average 1.410126582278481) internal successors, (557), 399 states have internal predecessors, (557), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2024-10-13 02:31:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 845 transitions. [2024-10-13 02:31:38,119 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 845 transitions. Word has length 214 [2024-10-13 02:31:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:38,119 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 845 transitions. [2024-10-13 02:31:38,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 845 transitions. [2024-10-13 02:31:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-13 02:31:38,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:38,122 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:38,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:31:38,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:38,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash -238448574, now seen corresponding path program 1 times [2024-10-13 02:31:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:38,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082155321] [2024-10-13 02:31:38,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:38,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 9 proven. 90 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-13 02:31:38,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:38,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082155321] [2024-10-13 02:31:38,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082155321] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:31:38,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869698928] [2024-10-13 02:31:38,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:38,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:31:38,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:31:38,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:31:38,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:31:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:38,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:31:38,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:31:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 399 proven. 90 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2024-10-13 02:31:39,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:31:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 9 proven. 90 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-13 02:31:39,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869698928] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:31:39,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:31:39,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 02:31:39,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970183398] [2024-10-13 02:31:39,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:31:39,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:31:39,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:39,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:31:39,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:31:39,269 INFO L87 Difference]: Start difference. First operand 548 states and 845 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-10-13 02:31:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:39,474 INFO L93 Difference]: Finished difference Result 985 states and 1485 transitions. [2024-10-13 02:31:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:31:39,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 215 [2024-10-13 02:31:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:39,479 INFO L225 Difference]: With dead ends: 985 [2024-10-13 02:31:39,479 INFO L226 Difference]: Without dead ends: 438 [2024-10-13 02:31:39,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 494 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:31:39,484 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 115 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:39,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 240 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:31:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-13 02:31:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 414. [2024-10-13 02:31:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 265 states have (on average 1.2867924528301886) internal successors, (341), 265 states have internal predecessors, (341), 136 states have call successors, (136), 12 states have call predecessors, (136), 12 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-13 02:31:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2024-10-13 02:31:39,528 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 215 [2024-10-13 02:31:39,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:39,528 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2024-10-13 02:31:39,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-10-13 02:31:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2024-10-13 02:31:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-13 02:31:39,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:39,533 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:39,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:31:39,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:31:39,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:39,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1373645492, now seen corresponding path program 1 times [2024-10-13 02:31:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:39,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189083772] [2024-10-13 02:31:39,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:39,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:31:40,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:40,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189083772] [2024-10-13 02:31:40,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189083772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:40,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:40,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:31:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150828968] [2024-10-13 02:31:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:40,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:31:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:40,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:31:40,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:31:40,018 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:40,511 INFO L93 Difference]: Finished difference Result 827 states and 1228 transitions. [2024-10-13 02:31:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:31:40,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-13 02:31:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:40,516 INFO L225 Difference]: With dead ends: 827 [2024-10-13 02:31:40,516 INFO L226 Difference]: Without dead ends: 608 [2024-10-13 02:31:40,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:31:40,517 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 164 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:40,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 526 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:31:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-13 02:31:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2024-10-13 02:31:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 377 states have (on average 1.2785145888594165) internal successors, (482), 377 states have internal predecessors, (482), 204 states have call successors, (204), 18 states have call predecessors, (204), 18 states have return successors, (204), 204 states have call predecessors, (204), 204 states have call successors, (204) [2024-10-13 02:31:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 890 transitions. [2024-10-13 02:31:40,574 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 890 transitions. Word has length 215 [2024-10-13 02:31:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:40,574 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 890 transitions. [2024-10-13 02:31:40,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 890 transitions. [2024-10-13 02:31:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-13 02:31:40,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:40,576 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:40,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 02:31:40,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:40,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:40,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2074710070, now seen corresponding path program 1 times [2024-10-13 02:31:40,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:40,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401961001] [2024-10-13 02:31:40,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-13 02:31:41,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:41,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401961001] [2024-10-13 02:31:41,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401961001] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:31:41,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886236418] [2024-10-13 02:31:41,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:41,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:31:41,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:31:41,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:31:41,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:31:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:41,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 02:31:41,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:31:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 876 proven. 144 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2024-10-13 02:31:42,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:31:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 48 proven. 147 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2024-10-13 02:31:43,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886236418] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:31:43,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:31:43,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 26 [2024-10-13 02:31:43,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489987362] [2024-10-13 02:31:43,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:31:43,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 02:31:43,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:43,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 02:31:43,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2024-10-13 02:31:43,763 INFO L87 Difference]: Start difference. First operand 600 states and 890 transitions. Second operand has 26 states, 25 states have (on average 5.32) internal successors, (133), 24 states have internal predecessors, (133), 8 states have call successors, (102), 4 states have call predecessors, (102), 8 states have return successors, (102), 8 states have call predecessors, (102), 8 states have call successors, (102) [2024-10-13 02:31:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:46,115 INFO L93 Difference]: Finished difference Result 1036 states and 1483 transitions. [2024-10-13 02:31:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 02:31:46,116 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.32) internal successors, (133), 24 states have internal predecessors, (133), 8 states have call successors, (102), 4 states have call predecessors, (102), 8 states have return successors, (102), 8 states have call predecessors, (102), 8 states have call successors, (102) Word has length 215 [2024-10-13 02:31:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:46,123 INFO L225 Difference]: With dead ends: 1036 [2024-10-13 02:31:46,124 INFO L226 Difference]: Without dead ends: 631 [2024-10-13 02:31:46,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1022, Invalid=2638, Unknown=0, NotChecked=0, Total=3660 [2024-10-13 02:31:46,130 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 994 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:46,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 533 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 02:31:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-13 02:31:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 413. [2024-10-13 02:31:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 256 states have (on average 1.23046875) internal successors, (315), 256 states have internal predecessors, (315), 136 states have call successors, (136), 20 states have call predecessors, (136), 20 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-13 02:31:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 587 transitions. [2024-10-13 02:31:46,263 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 587 transitions. Word has length 215 [2024-10-13 02:31:46,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:46,263 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 587 transitions. [2024-10-13 02:31:46,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.32) internal successors, (133), 24 states have internal predecessors, (133), 8 states have call successors, (102), 4 states have call predecessors, (102), 8 states have return successors, (102), 8 states have call predecessors, (102), 8 states have call successors, (102) [2024-10-13 02:31:46,264 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 587 transitions. [2024-10-13 02:31:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-13 02:31:46,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:46,266 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:46,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:31:46,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-13 02:31:46,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:46,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1368590443, now seen corresponding path program 1 times [2024-10-13 02:31:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120022069] [2024-10-13 02:31:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-13 02:31:46,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:46,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120022069] [2024-10-13 02:31:46,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120022069] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:31:46,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945966694] [2024-10-13 02:31:46,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:46,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:31:46,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:31:46,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:31:46,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 02:31:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:46,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 02:31:46,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:31:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 163 proven. 96 refuted. 0 times theorem prover too weak. 1985 trivial. 0 not checked. [2024-10-13 02:31:47,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:31:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-13 02:31:47,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945966694] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:31:47,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:31:47,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-13 02:31:47,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495132574] [2024-10-13 02:31:47,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:31:47,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 02:31:47,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:47,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 02:31:47,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:31:47,551 INFO L87 Difference]: Start difference. First operand 413 states and 587 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2024-10-13 02:31:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:48,091 INFO L93 Difference]: Finished difference Result 864 states and 1215 transitions. [2024-10-13 02:31:48,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 02:31:48,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 215 [2024-10-13 02:31:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:48,098 INFO L225 Difference]: With dead ends: 864 [2024-10-13 02:31:48,098 INFO L226 Difference]: Without dead ends: 452 [2024-10-13 02:31:48,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 492 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-13 02:31:48,100 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 123 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:48,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 672 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:31:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-13 02:31:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 418. [2024-10-13 02:31:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 261 states have (on average 1.2298850574712643) internal successors, (321), 261 states have internal predecessors, (321), 136 states have call successors, (136), 20 states have call predecessors, (136), 20 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-13 02:31:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 593 transitions. [2024-10-13 02:31:48,169 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 593 transitions. Word has length 215 [2024-10-13 02:31:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:48,169 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 593 transitions. [2024-10-13 02:31:48,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2024-10-13 02:31:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 593 transitions. [2024-10-13 02:31:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-13 02:31:48,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:48,171 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:48,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 02:31:48,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:31:48,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:48,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1311332141, now seen corresponding path program 1 times [2024-10-13 02:31:48,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:48,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834168463] [2024-10-13 02:31:48,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:48,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:31:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:31:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:31:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:31:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:31:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:31:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:31:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:31:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:31:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:31:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:31:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:31:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:31:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:31:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:31:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:31:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:31:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:31:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:31:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:31:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:31:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:31:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:31:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:31:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:31:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:31:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:31:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:31:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:31:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:31:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:31:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:31:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-13 02:31:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-13 02:31:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:31:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:31:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834168463] [2024-10-13 02:31:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834168463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:48,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:48,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:31:48,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206767230] [2024-10-13 02:31:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:48,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:31:48,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:31:48,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:31:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:31:48,526 INFO L87 Difference]: Start difference. First operand 418 states and 593 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:48,598 INFO L93 Difference]: Finished difference Result 640 states and 907 transitions. [2024-10-13 02:31:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:31:48,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-13 02:31:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:48,601 INFO L225 Difference]: With dead ends: 640 [2024-10-13 02:31:48,601 INFO L226 Difference]: Without dead ends: 213 [2024-10-13 02:31:48,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:31:48,603 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:48,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 131 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:31:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-13 02:31:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-10-13 02:31:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 134 states have (on average 1.2014925373134329) internal successors, (161), 134 states have internal predecessors, (161), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 02:31:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 297 transitions. [2024-10-13 02:31:48,633 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 297 transitions. Word has length 215 [2024-10-13 02:31:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:48,633 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 297 transitions. [2024-10-13 02:31:48,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 297 transitions. [2024-10-13 02:31:48,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-13 02:31:48,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:48,635 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:48,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 02:31:48,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:48,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash 801023057, now seen corresponding path program 1 times [2024-10-13 02:31:48,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:31:48,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972129628] [2024-10-13 02:31:48,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:48,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:31:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:31:48,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059435450] [2024-10-13 02:31:48,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:31:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:31:48,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:31:48,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 02:31:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:31:48,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:31:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:31:49,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:31:49,106 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:31:49,106 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:31:49,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 02:31:49,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:31:49,312 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:49,415 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:31:49,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:31:49 BoogieIcfgContainer [2024-10-13 02:31:49,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:31:49,418 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:31:49,418 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:31:49,418 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:31:49,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:31:29" (3/4) ... [2024-10-13 02:31:49,420 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:31:49,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:31:49,422 INFO L158 Benchmark]: Toolchain (without parser) took 20596.48ms. Allocated memory was 151.0MB in the beginning and 715.1MB in the end (delta: 564.1MB). Free memory was 80.0MB in the beginning and 389.2MB in the end (delta: -309.2MB). Peak memory consumption was 257.6MB. Max. memory is 16.1GB. [2024-10-13 02:31:49,422 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 151.0MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:31:49,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.72ms. Allocated memory is still 151.0MB. Free memory was 79.8MB in the beginning and 62.5MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 02:31:49,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.55ms. Allocated memory is still 151.0MB. Free memory was 62.3MB in the beginning and 58.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:31:49,423 INFO L158 Benchmark]: Boogie Preprocessor took 78.08ms. Allocated memory is still 151.0MB. Free memory was 58.2MB in the beginning and 118.4MB in the end (delta: -60.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-10-13 02:31:49,423 INFO L158 Benchmark]: RCFGBuilder took 573.64ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 118.3MB in the beginning and 156.4MB in the end (delta: -38.0MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-10-13 02:31:49,423 INFO L158 Benchmark]: TraceAbstraction took 19522.44ms. Allocated memory was 220.2MB in the beginning and 715.1MB in the end (delta: 494.9MB). Free memory was 156.4MB in the beginning and 390.3MB in the end (delta: -233.9MB). Peak memory consumption was 259.9MB. Max. memory is 16.1GB. [2024-10-13 02:31:49,423 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 715.1MB. Free memory was 390.3MB in the beginning and 389.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 02:31:49,424 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.45ms. Allocated memory is still 151.0MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.72ms. Allocated memory is still 151.0MB. Free memory was 79.8MB in the beginning and 62.5MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.55ms. Allocated memory is still 151.0MB. Free memory was 62.3MB in the beginning and 58.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.08ms. Allocated memory is still 151.0MB. Free memory was 58.2MB in the beginning and 118.4MB in the end (delta: -60.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * RCFGBuilder took 573.64ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 118.3MB in the beginning and 156.4MB in the end (delta: -38.0MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19522.44ms. Allocated memory was 220.2MB in the beginning and 715.1MB in the end (delta: 494.9MB). Free memory was 156.4MB in the beginning and 390.3MB in the end (delta: -233.9MB). Peak memory consumption was 259.9MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 715.1MB. Free memory was 390.3MB in the beginning and 389.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 205, overapproximation of someBinaryArithmeticDOUBLEoperation at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] signed char var_1_29 = 10; [L44] double var_1_30 = 0.5; [L45] double var_1_33 = 3.2; [L46] unsigned char var_1_34 = 2; [L47] unsigned char var_1_35 = 4; [L48] signed long int var_1_36 = -256; [L49] unsigned short int var_1_37 = 64; [L50] unsigned short int var_1_38 = 57633; [L51] unsigned short int var_1_39 = 28505; [L52] signed short int var_1_40 = 64; [L53] signed char var_1_41 = -100; [L54] unsigned short int var_1_42 = 5; [L55] signed char var_1_43 = 100; [L56] unsigned short int last_1_var_1_6 = 4; [L57] unsigned short int last_1_var_1_9 = 4; [L58] unsigned long int last_1_var_1_14 = 500; [L59] signed short int last_1_var_1_17 = 16; [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L199] last_1_var_1_6 = var_1_6 [L200] last_1_var_1_9 = var_1_9 [L201] last_1_var_1_14 = var_1_14 [L202] last_1_var_1_17 = var_1_17 [L212] RET updateLastVariables() [L213] CALL updateVariables() [L145] var_1_4 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] var_1_5 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] var_1_10 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] var_1_13 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] var_1_15 = __VERIFIER_nondet_ulong() [L159] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L161] var_1_16 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] var_1_19 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] var_1_20 = __VERIFIER_nondet_short() [L168] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] var_1_21 = __VERIFIER_nondet_short() [L171] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] var_1_22 = __VERIFIER_nondet_short() [L174] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] var_1_24 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L178] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L178] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L179] var_1_29 = __VERIFIER_nondet_char() [L180] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L180] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L181] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L181] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L182] var_1_33 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L183] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L184] var_1_35 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L185] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L186] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L186] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L187] var_1_38 = __VERIFIER_nondet_ushort() [L188] CALL assume_abort_if_not(var_1_38 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L188] RET assume_abort_if_not(var_1_38 >= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L189] CALL assume_abort_if_not(var_1_38 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L189] RET assume_abort_if_not(var_1_38 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L190] var_1_39 = __VERIFIER_nondet_ushort() [L191] CALL assume_abort_if_not(var_1_39 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L191] RET assume_abort_if_not(var_1_39 >= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L192] CALL assume_abort_if_not(var_1_39 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L192] RET assume_abort_if_not(var_1_39 <= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] var_1_41 = __VERIFIER_nondet_char() [L194] CALL assume_abort_if_not(var_1_41 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L194] RET assume_abort_if_not(var_1_41 >= -128) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L195] CALL assume_abort_if_not(var_1_41 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L195] RET assume_abort_if_not(var_1_41 <= 127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L196] CALL assume_abort_if_not(var_1_41 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L196] RET assume_abort_if_not(var_1_41 != 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L213] RET updateVariables() [L214] CALL step() [L63] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L69] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L70] COND TRUE (- var_1_11) >= var_1_11 [L71] var_1_26 = ((((var_1_24) > (var_1_29)) ? (var_1_24) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-500, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L73] EXPR var_1_6 ^ (var_1_17 % var_1_41) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-500, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L73] COND FALSE !(var_1_24 >= (var_1_6 ^ (var_1_17 % var_1_41))) [L82] var_1_40 = var_1_9 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-500, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L84] var_1_43 = var_1_24 [L85] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-500, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=5, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] COND TRUE last_1_var_1_14 >= stepLocal_3 [L87] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-500, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=5, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L89] var_1_25 = var_1_9 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=5, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L90] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=5, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L95] var_1_42 = var_1_39 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L96] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] COND TRUE (- var_1_14) > var_1_6 [L98] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L103] unsigned char stepLocal_2 = var_1_4; [L104] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=8589934465, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L105] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=8589934465, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L108] COND TRUE stepLocal_1 >= var_1_6 [L109] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L114] COND TRUE var_1_17 != ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) [L115] var_1_36 = (((((var_1_17 - var_1_17)) < ((((((var_1_24 + var_1_17)) < (var_1_9)) ? ((var_1_24 + var_1_17)) : (var_1_9))))) ? ((var_1_17 - var_1_17)) : ((((((var_1_24 + var_1_17)) < (var_1_9)) ? ((var_1_24 + var_1_17)) : (var_1_9)))))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-111, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L117] unsigned char stepLocal_5 = var_1_1; [L118] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-111, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L119] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-111, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L126] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-111, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L127] COND TRUE ! var_1_1 [L128] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-111, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L133] COND FALSE !(var_1_14 < var_1_24) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-111, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L136] COND TRUE (var_1_9 * (var_1_38 - var_1_9)) <= var_1_9 [L137] var_1_37 = ((var_1_39 - var_1_35) + var_1_9) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-111, var_1_37=16366, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L214] RET step() [L215] CALL, EXPR property() [L205-L206] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-111, var_1_37=16366, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=8589934465, var_1_15=2147483647, var_1_16=8589934481, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=4, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_34=2, var_1_35=17, var_1_36=-111, var_1_37=16366, var_1_38=32767, var_1_39=16383, var_1_40=4, var_1_41=16, var_1_42=16383, var_1_43=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 12, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2167 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2163 mSDsluCounter, 4459 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2588 mSDsCounter, 881 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2500 IncrementalHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 881 mSolverCounterUnsat, 1871 mSDtfsCounter, 2500 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2188 GetRequests, 2076 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=8, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 381 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 3433 NumberOfCodeBlocks, 3433 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3629 ConstructedInterpolants, 0 QuantifiedInterpolants, 14951 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1503 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 37224/38148 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:31:49,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9919edf89ff355ff3a89dd02d1d8130750e0281602370d18eeec2f6bdc3d61ca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:31:51,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:31:51,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:31:51,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:31:51,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:31:51,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:31:51,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:31:51,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:31:51,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:31:51,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:31:51,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:31:51,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:31:51,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:31:51,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:31:51,743 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:31:51,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:31:51,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:31:51,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:31:51,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:31:51,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:31:51,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:31:51,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:31:51,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:31:51,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:31:51,746 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:31:51,747 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:31:51,747 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:31:51,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:31:51,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:31:51,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:31:51,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:31:51,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:31:51,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:31:51,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:31:51,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:31:51,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:31:51,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:31:51,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:31:51,750 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:31:51,751 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:31:51,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:31:51,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:31:51,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:31:51,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:31:51,751 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:31:51,752 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9919edf89ff355ff3a89dd02d1d8130750e0281602370d18eeec2f6bdc3d61ca [2024-10-13 02:31:52,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:31:52,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:31:52,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:31:52,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:31:52,085 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:31:52,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i [2024-10-13 02:31:53,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:31:53,844 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:31:53,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i [2024-10-13 02:31:53,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a82c2a8c/e9929d9a83eb4c4f815b7ecde0074973/FLAG613ee919c [2024-10-13 02:31:54,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a82c2a8c/e9929d9a83eb4c4f815b7ecde0074973 [2024-10-13 02:31:54,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:31:54,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:31:54,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:31:54,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:31:54,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:31:54,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69533637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54, skipping insertion in model container [2024-10-13 02:31:54,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:31:54,536 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i[918,931] [2024-10-13 02:31:54,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:31:54,628 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:31:54,639 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i[918,931] [2024-10-13 02:31:54,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:31:54,731 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:31:54,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54 WrapperNode [2024-10-13 02:31:54,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:31:54,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:31:54,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:31:54,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:31:54,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,783 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-10-13 02:31:54,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:31:54,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:31:54,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:31:54,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:31:54,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,821 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:31:54,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:31:54,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:31:54,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:31:54,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:31:54,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (1/1) ... [2024-10-13 02:31:54,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:31:54,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:31:54,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:31:54,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:31:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:31:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:31:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:31:54,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:31:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:31:54,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:31:55,032 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:31:55,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:31:55,966 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 02:31:55,967 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:31:56,009 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:31:56,010 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:31:56,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:31:56 BoogieIcfgContainer [2024-10-13 02:31:56,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:31:56,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:31:56,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:31:56,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:31:56,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:31:54" (1/3) ... [2024-10-13 02:31:56,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28239289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:31:56, skipping insertion in model container [2024-10-13 02:31:56,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:31:54" (2/3) ... [2024-10-13 02:31:56,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28239289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:31:56, skipping insertion in model container [2024-10-13 02:31:56,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:31:56" (3/3) ... [2024-10-13 02:31:56,017 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-4.i [2024-10-13 02:31:56,034 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:31:56,035 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:31:56,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:31:56,118 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@fe3ec77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:31:56,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:31:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 02:31:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-13 02:31:56,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:56,139 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:56,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:56,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2074360865, now seen corresponding path program 1 times [2024-10-13 02:31:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:31:56,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470850289] [2024-10-13 02:31:56,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:31:56,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:31:56,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:31:56,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:31:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:56,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:31:56,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:31:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2024-10-13 02:31:56,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:31:56,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:31:56,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470850289] [2024-10-13 02:31:56,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470850289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:56,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:56,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:31:56,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131586586] [2024-10-13 02:31:56,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:56,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:31:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:31:56,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:31:56,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:31:56,633 INFO L87 Difference]: Start difference. First operand has 93 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 02:31:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:57,035 INFO L93 Difference]: Finished difference Result 183 states and 334 transitions. [2024-10-13 02:31:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:31:57,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 211 [2024-10-13 02:31:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:57,056 INFO L225 Difference]: With dead ends: 183 [2024-10-13 02:31:57,057 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 02:31:57,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:31:57,062 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:57,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:31:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 02:31:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 02:31:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 02:31:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 145 transitions. [2024-10-13 02:31:57,099 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 145 transitions. Word has length 211 [2024-10-13 02:31:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:57,099 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 145 transitions. [2024-10-13 02:31:57,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 02:31:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 145 transitions. [2024-10-13 02:31:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-13 02:31:57,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:57,103 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:57,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:31:57,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:31:57,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:57,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash -521936064, now seen corresponding path program 1 times [2024-10-13 02:31:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:31:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446400743] [2024-10-13 02:31:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:57,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:31:57,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:31:57,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:31:57,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:31:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:57,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 02:31:57,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:31:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:31:58,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:31:58,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:31:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446400743] [2024-10-13 02:31:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446400743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:31:58,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:31:58,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:31:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687416034] [2024-10-13 02:31:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:31:58,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:31:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:31:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:31:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:31:58,236 INFO L87 Difference]: Start difference. First operand 91 states and 145 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:31:58,614 INFO L93 Difference]: Finished difference Result 271 states and 433 transitions. [2024-10-13 02:31:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:31:58,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2024-10-13 02:31:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:31:58,619 INFO L225 Difference]: With dead ends: 271 [2024-10-13 02:31:58,619 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 02:31:58,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:31:58,621 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:31:58,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 290 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:31:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 02:31:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2024-10-13 02:31:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 108 states have internal predecessors, (151), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 02:31:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 287 transitions. [2024-10-13 02:31:58,650 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 287 transitions. Word has length 212 [2024-10-13 02:31:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:31:58,651 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 287 transitions. [2024-10-13 02:31:58,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:31:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 287 transitions. [2024-10-13 02:31:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-13 02:31:58,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:31:58,655 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:31:58,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 02:31:58,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:31:58,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:31:58,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:31:58,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1339584514, now seen corresponding path program 1 times [2024-10-13 02:31:58,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:31:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412612525] [2024-10-13 02:31:58,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:31:58,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:31:58,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:31:58,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:31:58,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:31:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:31:59,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 02:31:59,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:32:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 319 proven. 183 refuted. 0 times theorem prover too weak. 1742 trivial. 0 not checked. [2024-10-13 02:32:00,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:32:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 9 proven. 186 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2024-10-13 02:32:00,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:32:00,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412612525] [2024-10-13 02:32:00,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412612525] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:32:00,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:32:00,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-10-13 02:32:00,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105629589] [2024-10-13 02:32:00,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:32:00,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 02:32:00,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:32:00,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 02:32:00,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:32:00,774 INFO L87 Difference]: Start difference. First operand 179 states and 287 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2024-10-13 02:32:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:32:01,966 INFO L93 Difference]: Finished difference Result 411 states and 634 transitions. [2024-10-13 02:32:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 02:32:01,967 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 212 [2024-10-13 02:32:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:32:01,973 INFO L225 Difference]: With dead ends: 411 [2024-10-13 02:32:01,973 INFO L226 Difference]: Without dead ends: 233 [2024-10-13 02:32:01,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 409 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-10-13 02:32:01,975 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 212 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:32:01,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 418 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 02:32:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-13 02:32:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 200. [2024-10-13 02:32:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 125 states have (on average 1.296) internal successors, (162), 125 states have internal predecessors, (162), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 02:32:02,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 298 transitions. [2024-10-13 02:32:02,017 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 298 transitions. Word has length 212 [2024-10-13 02:32:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:32:02,018 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 298 transitions. [2024-10-13 02:32:02,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2024-10-13 02:32:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 298 transitions. [2024-10-13 02:32:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-13 02:32:02,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:32:02,026 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:32:02,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 02:32:02,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:32:02,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:32:02,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:32:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 606115251, now seen corresponding path program 1 times [2024-10-13 02:32:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:32:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750278444] [2024-10-13 02:32:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:32:02,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:32:02,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:32:02,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:32:02,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 02:32:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:32:02,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:32:02,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:32:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:32:02,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:32:02,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:32:02,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750278444] [2024-10-13 02:32:02,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750278444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:32:02,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:32:02,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:32:02,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81404443] [2024-10-13 02:32:02,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:32:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:32:02,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:32:02,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:32:02,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:32:02,875 INFO L87 Difference]: Start difference. First operand 200 states and 298 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:32:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:32:03,909 INFO L93 Difference]: Finished difference Result 403 states and 598 transitions. [2024-10-13 02:32:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:32:03,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213 [2024-10-13 02:32:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:32:03,912 INFO L225 Difference]: With dead ends: 403 [2024-10-13 02:32:03,912 INFO L226 Difference]: Without dead ends: 297 [2024-10-13 02:32:03,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:32:03,914 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 186 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:32:03,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 367 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 02:32:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-13 02:32:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2024-10-13 02:32:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 181 states have (on average 1.270718232044199) internal successors, (230), 181 states have internal predecessors, (230), 102 states have call successors, (102), 9 states have call predecessors, (102), 9 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-13 02:32:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 434 transitions. [2024-10-13 02:32:03,945 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 434 transitions. Word has length 213 [2024-10-13 02:32:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:32:03,946 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 434 transitions. [2024-10-13 02:32:03,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:32:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 434 transitions. [2024-10-13 02:32:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-13 02:32:03,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:32:03,948 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:32:03,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 02:32:04,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:32:04,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:32:04,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:32:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1307179829, now seen corresponding path program 1 times [2024-10-13 02:32:04,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:32:04,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517473739] [2024-10-13 02:32:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:32:04,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:32:04,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:32:04,158 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:32:04,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 02:32:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:32:04,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 02:32:04,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:32:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 849 proven. 75 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2024-10-13 02:32:05,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:32:05,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:32:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517473739] [2024-10-13 02:32:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517473739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:32:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1035023881] [2024-10-13 02:32:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:32:05,889 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 02:32:05,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 02:32:05,893 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 02:32:05,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-13 02:32:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:32:06,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 02:32:06,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:32:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 970 proven. 141 refuted. 0 times theorem prover too weak. 1133 trivial. 0 not checked. [2024-10-13 02:32:08,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:32:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1035023881] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:32:08,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:32:08,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-10-13 02:32:08,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603127791] [2024-10-13 02:32:08,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:32:08,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 02:32:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:32:08,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 02:32:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-13 02:32:08,597 INFO L87 Difference]: Start difference. First operand 293 states and 434 transitions. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 16 states have internal predecessors, (97), 5 states have call successors, (68), 5 states have call predecessors, (68), 8 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) [2024-10-13 02:32:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:32:12,796 INFO L93 Difference]: Finished difference Result 746 states and 1072 transitions. [2024-10-13 02:32:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 02:32:12,797 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 16 states have internal predecessors, (97), 5 states have call successors, (68), 5 states have call predecessors, (68), 8 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) Word has length 213 [2024-10-13 02:32:12,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:32:12,804 INFO L225 Difference]: With dead ends: 746 [2024-10-13 02:32:12,804 INFO L226 Difference]: Without dead ends: 454 [2024-10-13 02:32:12,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 02:32:12,809 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 466 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:32:12,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 650 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 02:32:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-10-13 02:32:12,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 419. [2024-10-13 02:32:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 262 states have (on average 1.2366412213740459) internal successors, (324), 262 states have internal predecessors, (324), 136 states have call successors, (136), 20 states have call predecessors, (136), 20 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-13 02:32:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 596 transitions. [2024-10-13 02:32:12,862 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 596 transitions. Word has length 213 [2024-10-13 02:32:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:32:12,864 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 596 transitions. [2024-10-13 02:32:12,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 16 states have internal predecessors, (97), 5 states have call successors, (68), 5 states have call predecessors, (68), 8 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) [2024-10-13 02:32:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 596 transitions. [2024-10-13 02:32:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-13 02:32:12,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:32:12,866 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:32:12,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-10-13 02:32:13,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 02:32:13,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:32:13,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:32:13,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:32:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash -686964877, now seen corresponding path program 1 times [2024-10-13 02:32:13,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:32:13,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508250910] [2024-10-13 02:32:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:32:13,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:32:13,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:32:13,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:32:13,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 02:32:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:32:13,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:32:13,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:32:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:32:14,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:32:14,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:32:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508250910] [2024-10-13 02:32:14,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508250910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:32:14,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:32:14,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:32:14,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476490792] [2024-10-13 02:32:14,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:32:14,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:32:14,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:32:14,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:32:14,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:32:14,267 INFO L87 Difference]: Start difference. First operand 419 states and 596 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:32:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:32:15,222 INFO L93 Difference]: Finished difference Result 628 states and 887 transitions. [2024-10-13 02:32:15,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:32:15,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213 [2024-10-13 02:32:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:32:15,235 INFO L225 Difference]: With dead ends: 628 [2024-10-13 02:32:15,235 INFO L226 Difference]: Without dead ends: 210 [2024-10-13 02:32:15,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:32:15,237 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 70 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 02:32:15,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 416 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 02:32:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-13 02:32:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 187. [2024-10-13 02:32:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 108 states have (on average 1.1481481481481481) internal successors, (124), 108 states have internal predecessors, (124), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 02:32:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 260 transitions. [2024-10-13 02:32:15,261 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 260 transitions. Word has length 213 [2024-10-13 02:32:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:32:15,262 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 260 transitions. [2024-10-13 02:32:15,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:32:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 260 transitions. [2024-10-13 02:32:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 02:32:15,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:32:15,264 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:32:15,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 02:32:15,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:32:15,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:32:15,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:32:15,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1683297757, now seen corresponding path program 1 times [2024-10-13 02:32:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:32:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854045899] [2024-10-13 02:32:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:32:15,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:32:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:32:15,468 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:32:15,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 02:32:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:32:15,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 02:32:15,714 INFO L278 TraceCheckSpWp]: Computing forward predicates...